Results 1 
7 of
7
Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
 Bulletin of Symbolic Logic
, 1997
"... We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability dist ..."
Abstract

Cited by 48 (10 self)
 Add to MetaCart
We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence and uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chao...
A New Representation for Exact Real Numbers
, 1997
"... We develop the theoretical foundation of a new representation of real numbers based on the infinite composition of linear fractional transformations (lft), equivalently the infiite product of matrices, with nonnegative coefficients. Any rational interval in the one point compactification of the rea ..."
Abstract

Cited by 42 (8 self)
 Add to MetaCart
We develop the theoretical foundation of a new representation of real numbers based on the infinite composition of linear fractional transformations (lft), equivalently the infiite product of matrices, with nonnegative coefficients. Any rational interval in the one point compactification of the real line, represented by the unit circle S¹, is expressed as the image of the base interval [0�1] under an lft. A sequence of shrinking nested intervals is then represented by an infinite product of matrices with integer coefficients such that the first socalled sign matrix determines an interval on which the real number lies. The subsequent socalled digit matrices have nonnegative integer coe cients and successively re ne that interval. Based on the classi cation of lft's according to their conjugacy classes and their geometric dynamics, we show that there is a canonical choice of four sign matrices which are generated by rotation of S¹ by =4. Furthermore, the ordinary signed digit representation of real numbers in a given base induces a canonical choice of digit matrices.
Semantics of Exact Real Arithmetic
, 1997
"... In this paper, we incorporate a representation of the nonnegative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the exten ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
In this paper, we incorporate a representation of the nonnegative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational semantics.
Contractivity of Linear Fractional Transformations
 Third Real Numbers and Computers Conference (RNC3
, 1998
"... One possible approach to exact real arithmetic is to use linear fractional transformations (LFT's) to represent real numbers and computations on real numbers. Recursive expressions built from LFT's are only convergent (i.e., denote a welldefined real number) if the involved LFT's are sufficiently c ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
One possible approach to exact real arithmetic is to use linear fractional transformations (LFT's) to represent real numbers and computations on real numbers. Recursive expressions built from LFT's are only convergent (i.e., denote a welldefined real number) if the involved LFT's are sufficiently contractive. In this paper, we define a notion of contractivity for LFT's. It is used for convergence theorems and for the analysis and improvement of algorithms for elementary functions. Keywords : Exact Real Arithmetic, Linear Fractional Transformations 1 Introduction Linear Fractional Transformations (LFT's) provide an elegant approach to real number arithmetic [8, 17, 11, 14, 12, 6]. Onedimensional LFT's x 7! ax+c bx+d are used in the representation of real numbers and to implement basic unary functions, while twodimensional LFT's (x; y) 7! axy+cx+ey+g bxy+dx+fy+h provide binary operations such as addition and multiplication, and can be combined to obtain infinite expression trees ...
The Appearance of Big Integers in Exact Real Arithmetic based on Linear Fractional Transformations
 In Proc. Foundations of Software Science and Computation Structures (FoSSaCS '98), volume 1378 of LNCS
, 1997
"... . One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. In this paper, we show that the bit sizes of the (integer) parameters of nearly all transformations used in computations are proportional to the nu ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
. One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. In this paper, we show that the bit sizes of the (integer) parameters of nearly all transformations used in computations are proportional to the number of basic computational steps executed so far. Here, a basic step means consuming one digit of the argument(s) or producing one digit of the result. 1 Introduction Linear Fractional Transformations (LFT's) provide an elegant approach to real number arithmetic [8, 16, 11, 14, 12, 6]. Onedimensional LFT's x 7! ax+c bx+d are used as digits and to implement basic functions, while twodimensional LFT's (x; y) 7! axy+cx+ey+g bxy+dx+fy+h provide binary operations such as addition and multiplication, and can be combined to infinite expression trees denoting transcendental functions. In Section 2, we present the details of the LFT approach. This provides the background for understanding the r...
How Many Argument Digits are Needed to Produce n Result Digits?
 In RealComp '98 Workshop (June 1998 in Indianapolis), volume 24 of Electronic Notes in Theoretical Computer Science
, 1999
"... In the LFT approach to Exact Real Arithmetic, we study the question how many argument digits are needed to produce a certain number of result digits. We present upper and lower bounds for many simple functions and operations, and for exponential and square root. 1 Introduction In this paper, we wor ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In the LFT approach to Exact Real Arithmetic, we study the question how many argument digits are needed to produce a certain number of result digits. We present upper and lower bounds for many simple functions and operations, and for exponential and square root. 1 Introduction In this paper, we work in an approach to Exact Real Arithmetic where real numbers are represented as potentially infinite streams of information units, called digits. Hence, an algorithm to compute a certain expression over real numbers is a device that reads some input streams and produces an output stream. Algorithms like this never terminate, but are considered as satisfactory if they produce any desired number of output digits in finite time, i.e., from a finite number of input digits by a finite number of internal operations. The (time) efficiency of a real number algorithm indicates how much time T (n) it takes to produce n result digits. It clearly depends on the number of input digits needed to produce ...
Big Integers and Complexity Issues in Exact Real Arithmetic
 In Third Comprox workshop
, 1998
"... One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. We show how to determine the digits that can be emitted from a transformation, and present a criterion which ensures that it is possible to emit a di ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. We show how to determine the digits that can be emitted from a transformation, and present a criterion which ensures that it is possible to emit a digit. Using these results, we prove that the obvious algorithm to compute n digits from the application of a transformation to a real number has complexity O(n 2 ), and present a method to reduce this complexity to that of multiplying two n bit integers. 1 Introduction Linear Fractional Transformations (LFT's) provide an elegant approach to real number arithmetic [5,14,9,12,10,4]. Onedimensional LFT's x 7! ax+c bx+d are used as digits and to implement basic unary functions, while twodimensional LFT's (x; y) 7! axy+cx+ey+g bxy+dx+fy+h provide binary operations such as addition and multiplication, and can be combined to obtain infinite expression trees denoting transcendental functions...