How many argument digits are needed to produce n result digits?

Electronic Notes in Theoretical Computer Science

Volumn 24, Issue , 2000, Pages 13-33

  Heckmann, Reinhold ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; NUMBER THEORY; THEOREM PROVING;

INPUT COMPLEXITY; LINEAR FUNCTIONAL TRANSFORMATIONS (LFT); REAL NUMBER ARITHMETIC; TRANSCENDENTAL FUNCTIONS;

DIGITAL ARITHMETIC;

EID: 19144367435     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82523-X     Document Type: Conference Paper

References (13)

1. Avizienis A. Signed-digit number representations for fast parallel arithmetic. IRE Transactions on Electronic Computers. 10:1961;389-400
2. A. Edalat and P. Potts. A new representation for exact real numbers. In S. Brookes and M. Mislove, editors, MFPS ′97, volume 6 of Electronic Notes in Theoretical Computer Science, 1997. URL:http://www.elsevier.nl/Iocate/entcs/ volume6.html.
3. Gosper W. Continued fraction arithmetic. Technical Report HAKMEM Item 101B, MIT Artificial Intelligence Memo 239. 1972;MIT
4. Heckmann R. 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. 1998;172-188 Springer-Verlag
5. R. Heckmann. Big integers and complexity issues in exact real arithmetic. In Third Comprox workshop (Sept. 1991 in Birmingham), volume 13 of Electronic Notes in Theoretical Computer Science, 1998. URL:http://www.elsevier.nl/locate/ entcs/volume13.html.
6. R. Heckmann. Contractivity of linear fractional transformations. In J.-M. Chesneaux, F. Jézéquel, J.-L. Lamotte, and J. Vignes, editors, Third Real Numbers and Computers Conference (RNC3), pages 45-59, April 1998.
7. Nielsen A., Kornerup P. MSB-first digit serial arithmetic. J. of Univ. Comp. Scien. 1:(7):1995;523-543
8. Potts P.J., Edalat A. Exact real arithmetic based on linear fractional transformations. Draft, Imperial College, available from http://www-tfm.doc.ic. ac.uk/~pjp. December 1996
9. Potts P.J., Edalat A. Exact real computer arithmetic. Draft, Imperial College. March 1997;. available from http://www-tfm.doc.ic.ac.uk/~pjp
10. Potts P.J. Computable real arithmetic using linear fractional transformations. Draft PhD Thesis, Imperial College. June 1996;. available from http://www-tfm.doc.ic.ac.uk/~pjp
11. Potts P.J. Efficient on-line computation of real functions using exact floating point. May 1998;. Available from http://www-tfm.doc.ic.ac.uk/~pjp
12. Potts P., Edalat A., Escardó M. Semantics of exact real arithmetic. Proc. Twelfth Annual IEEE Symposium on Logic in Computer Science. 1997;248-257. IEEE
13. Vuillemin J.E. Exact real computer arithmetic with continued fractions. IEEE Transactions on Computers. 39:(8):1990;1087-1105