Skip to main content

Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations

  • Conference paper
  • First Online:
Computability and Complexity in Analysis (CCA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2064))

Included in the following conference series:

  • 411 Accesses

Abstract

A real number can be represented as a sequence of nested, closed intervals whose lengthes tend to zero. In the LFT approach to Exact Real Arithmetic the sequence of intervals is generated by a sequence of one-dimensional linear fractional transformations (1-LFTs) applied to a base interval, [9,13,11,4,12,7].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Di Gianantonio, P.: A Golden Ratio Notation for the Real Numbers. CWI Technical Report (1991).

    Google Scholar 

  2. Edalat, A.: Domains for Computation in Mathematics, Physics and Exact Real Arithmetic. Bulletin of Symbolic Logic, Vol. 3 (1997).

    Google Scholar 

  3. Edalat, A., Heckmann R.: Computation with Real Numbers. Applied Semantics Summer School, APPSEM 2000 (2000).

    Google Scholar 

  4. Edalat, A., Potts, P. J.: A New Representation for Exact Real Numbers. Electronic Notes in Theoretical Computer Science, Vol. 6 (1997).

    Google Scholar 

  5. Errington, L., Heckmann, R.: Using the C-LFT Library (2000).

    Google Scholar 

  6. Gosper, R. W.: Continued Fraction Arithmetic. HAKMEM Item 101B, MIT AI Memo 239, MIT (1972).

    Google Scholar 

  7. Heckmann, R.: How Many Argument Digits are Needed to Produce n Result Digits? Electronic Notes in Theoretical Computer Science, Vol. 24 (2000).

    Google Scholar 

  8. Kelsey, T. W.: Exact Numerical Computation Via Symbolic Computation. Proceedings of Computability and Complexity in Analysis 2000, 187–197 (2000).

    Google Scholar 

  9. Kornerup, P., Matula, D. W.: Finite Precision Lexicographic Continued Fraction Number Systems. Proceedings of 7th IEEE Symposium on Computer Arithmetic, 207–0214 (1985).

    Google Scholar 

  10. Menissier-Morain, V.: Arbitrary Precision Real Arithmetic: Design and Algorithms. Submitted to Journal Symbolic Computation (1996).

    Google Scholar 

  11. Nielsen, A., Kornerup P.: MSBFirst Digit Serial Arithmetic. Journal of Univ. Comp. Science, 1(7):523543 (1995).

    Google Scholar 

  12. Potts, P. J.: Exact Real Arithmetic Using Möbius Transformations. PhD Thesis, University of London, Imperial College (1998).

    Google Scholar 

  13. Vuillemin, J. E.: Exact Real Computer Arithmetic with Continued Fractions. IEEE Transactions on Computers, 39(8):10871105 (1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krznarić, M. (2001). Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45335-0_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42197-9

  • Online ISBN: 978-3-540-45335-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics