Dynamics of number systems. Computation with arbitrary precision (Q318827): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Ilia V. Boikov / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Ilia V. Boikov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-33367-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243758454 / rank
 
Normal rank

Latest revision as of 22:35, 19 March 2024

scientific article
Language Label Description Also known as
English
Dynamics of number systems. Computation with arbitrary precision
scientific article

    Statements

    Dynamics of number systems. Computation with arbitrary precision (English)
    0 references
    0 references
    5 October 2016
    0 references
    The book consists of eight chapters: 1. Introduction, 2. Symbolic dynamics, 3. Matrices and transformations, 4. Möbius number systems, 5. Arithmetical algorithms, 6. Integer vectors and matrices, 7. Algebraic number fields, 8. Transcendent algorithms. Chapter 1 is a introduction to the classical positional number system and number systems, based on continued fractions. Chapter 2 consists of items: 2.1. Metric spaces, 2.2. The Canter space, 2.3. Redundant symbolic extensions, 2.4. Subshifts, 2.5. Sofic subshifts, 2.6. Labelled graphs. Chapter 3 explains why projective geometry gives insights into the spaces connected with number systems. Chapter 4 is devoted to the theory of Möbius number systems. A special treatment is given to sofic Möbius number systems for which arithmetical algorithms work. Chapter 5 develops the calculus of bilinear tensors which represent binary arithmetical operators. Chapter 6 treats number systems whose matrices have integer entries. In particular, modular systems have transformations with unit determinant. In modular number systems, the unary algorithm can be computed by a finite state transducer. Chapter 7 is devoted to the theory of number systems with matrices whose entries are algebraic numbers. It is given a review of the theory of algebraic extension fields, algebraic integers and integral basis, classical results of Parry and Schmidt on positional number systems and algorithms of parallel addition in positional number systems. In Chapter 8, algorithms for the computation of transcendent functions are given. It is presented the theory of Padé approximation and the representation of transcendental functions by general continued fractions. The book is a source of valuable and useful information on dynamics of number systems and scientific computation with arbitrary precision. It is addressed to scholars, scientists and engineers, and graduate students. The treatment is elementary and self-contained with focus both to the theory and applications. The basic prerequisite of the book is linear algebra and matrix calculus.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references