# Translation of Taylor series into LFT expansions

## Abstract

In Exact Real Arithmetic, real numbers are represented as potentially infinite streams of information units, called *digits*. In this paper, we work in the framework of *Linear Fractional Transformations* (LFT’s, also known as Möbius transformations) that provide an elegant approach to real number arithmetic (Gosper 1972, Vuillemin 1990, Nielsen and Kornerup 1995, Potts and Edalat 1996, Edalat and Potts 1997, Potts 1998b). Onedimensional LFT’s are used as digits and to implement basic unary functions, while two-dimensional LFT’s provide binary operations such as addition and multiplication, and can be combined to obtain infinite expression trees denoting transcendental functions. Peter Potts (1998a, 1998b) derived these expression trees from *continued fraction expansions* of the transcendental functions. In contrast, we show how to derive LFT expression trees from *power series*, which are available for a greater range of functions. In Section 2, we present the LFT approach in some detail. Section 3 contains the main results of the paper. We first derive an LFT expansion from apower series using Homer’s scheme (Section 3.1). The results are not very satisfactory. Thus, we show how LFT expansions may be modified using algebraic transformations (Section 3.2). A particular such transformation, presented in Section 3.3, yields satisfactory results for standard functions, as shown in the final examples section 4.

## Keywords

Power Series Linear Fractional Transformation Infinite Product Nest Sequence Expression Tree## Preview

Unable to display preview. Download preview PDF.

## References

- Edalat, A., Potts, P. (1997): A new representation for exact real numbers. In: Thirteenth Annual Conference on Mathematical Foundations of Programming Semantics, MFPS XIII, Pittsburgh, Pennsylvania. Elsevier Science B.V., Amsterdam, URL: http://www.elsevier.nl/locate/entcs/volume6.html (Electronic Notes in Theoretical Computer Science, vol. 6)Google Scholar
- Gosper, W. (1972): Continued fraction arithmetic. In: Technical Report HAKMEM Item 101B, MIT Artificial Intelligence Memo 239, MIT.Google Scholar
- Heckmann, R. (2000): How many argument digits are needed to produce
*n*result digits? In: Real Number Computation, RealComp’ 98, Indianapolis, Indiana. Elsevier Science B.V., Amsterdam, URL:http://www.elsevier.nl/locate/entcslvolume24.html (Electronic Notes in Theoretical Computer Seience, vol. 24)Google Scholar - Nielsen, A., Kornerup, P. (1995): MSB-first digit serial arithmetic. J. of Univ. Comp. Scien. 1(7): 523–543MathSciNetGoogle Scholar
- Potts, P.J. (1998a): Efficient on-line computation of real functions using exact floating point. Draft report, Imperial College, London. URL: http://www.purplefinder.com/
^{~}potts/pub/phd/efficient.ps.gzGoogle Scholar - Potts, P.J. (1998b): Exact Real Arithmetic using Möbius Transformations. PhD thesis, Imperial College, London. URL: http://www.purplefinder.com/
^{~}potts/thesis.ps.gzGoogle Scholar - Potts, P.J., Edalat, A. (1996): Exact real arithmetic based on linear fractional transformations. Draft report, Imperial College, London. URL: http://www.purplefinder.com/
^{~}potts/pub/phd/stanford.ps.gzGoogle Scholar - Potts, P.J., Edalat, A. (1997): Exact real computer arithmetic. Draft report, Imperial College, London. URL: http://www.purplefinder.com/
^{~}potts/pub/phd/normal.ps.gzGoogle Scholar - Vuillemin, J.E. (1990): Exact real computer arithmetic with continued fractions. IEEE Transactions on Computers 39(8): 1087–1105MathSciNetCrossRefGoogle Scholar