-
The Appearance of Big Integers in Exact Real Arithmetic
based on Linear Fractional Transformations,
Foundations of Software Science and Computation Structures,
Springer LNCS 1378, 172 - 188 (1998)
[Abstract]
[Paper.ps.gz (17p, 60k)]
-
Contractivity of Linear Fractional Transformations,
Third Real Numbers and Computers Conference (RNC3),
45 - 59 (1998).
Updated version:
Theoretical Computer Science, Vol. 279 (1), 65 - 82 (2002).
[Abstract]
[Paper.ps.gz (15p, 60k, reformatted)]
-
Big Integers and Complexity Issues
in Exact Real Arithmetic,
Third Comprox workshop, Birmingham (Sept. 1997).
Electronic Notes
in Theoretical Computer Science,
Vol. 13 (1998)
URL:
http://www.elsevier.nl/locate/entcs/volume13.html
[Abstract]
[Paper.ps.gz (20p, 82k)]
-
How Many Argument Digits are Needed
to Produce n Result Digits?
RealComp '98 Real Number Computation, Indianapolis (June 1998).
Electronic Notes
in Theoretical Computer Science,
Vol. 24 (2000)
URL:
http://www.elsevier.nl/locate/entcs/volume24.html
[Abstract]
[Paper.ps.gz (21p, 84k)]
-
Translation of Taylor series into LFT expansions,
presented at
Dagstuhl Seminar
"Symbolic
Algebraic Methods and Verification Methods"
(Nov. 1999).
Published in: G. Alefeld, J. Rohn, S. Rump, T. Yamamoto (eds.),
Symbolic Algebraic Methods and Verification Methods,
Springer-Verlag, 2001.
[Introduction]
[Paper.ps.gz (10p, 40k)]
-
With Abbas Edalat:
Computing with Real Numbers:
I. The LFT Approach to Real Number Computation;
II. A Domain Framework for Computational Geometry.
In: Gilles Barthe, Peter Dybjer, Luis Pinto, and Joao Saraiva (eds.),
Applied Semantics -
Lecture Notes from the International Summer School,
Caminha, Portugal, September 2000.
Springer LNCS 2395, 193-267 (2002)
[Abstract]
[Paper.ps.gz (72p, 360k)]
Two pages on one (without down-scaling!):
[Paper.ps.gz (36p, 360k)] for A4 paper,
[Paper.ps.gz (36p, 360k)] for Letter paper.
Reinhold Heckmann /
heckmann@absint.com