References

1

N. N. Abdelmalek. The discrete one-sided chebyshev approximation. Inst. Maths. Applics., 18:361-370, 1976.

2

Harold Abelson and Gerald Jay Sussman with Julie Sussman. Structure and Interpretation of Computer Programs. MIT Press, Cambridge, Massachusetts, 1985.

3

Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley Series in Computer Science. Addison-Wesley, Menlo Park, California, 1986.

4

G tz Alefeld and J rgen Herzberger. Introduction to Interval Computations. Academic Press, New York, 1983.

5

American National Standards Institute / Institute of Electrical and Electronics Engineers, New York. IEEE Standard for Binary Floating-Point Arithmetic, 1985. ANSI/IEEE Standard 754-1985.

6

American National Standards Institute / Institute of Electrical and Electronics Engineers, New York. IEEE Standard for Radix-Independent Floating-Point Arithmetic, 1985. ANSI/IEEE Standard 854-1987.

7

Herbert Arkin and Raymond R. Colton. Graphs: How to Make and Use Them. Harper & Brothers Publishers, New York and London, 1936.

8

B. Artmann. The Concept of Number: from quaternions to monads and topological fields. Ellis Horwood Limited, Market Cross House, Cooper Street, Chichester, West Sussex, PO19 1EB, England, 1988.

9

Algirdas Avizienis. Signed-digit number representations for fast parallel arithmetic. IEEE Transactions on Electronic Computers, EC-10:389-400, 1961.

10

F. A. Behrend. A contribution to the theory of magnitudes and the foundations of analysis. Math. Zeitschrift, 63:345-362, 1956.

11

I. S. Berezin and N. P. Zhidkov. Computing Methods, volume I, chapter 2, pages 72-82. Addison-Wesley, 1965. Translated by O. M. Blunn.

12

E. Bishop and D. Bridges. Constructive Real Analysis. Springer-Verlag, Berlin, 1985.

13

G. Bohlender. Computer Arithmetic and Self-Validating Numerical Methods, volume 7 of Notes and Reports in Mathematics in Science and Engineering, chapter What Do We Need Beyond IEEE Arithmetic? Academic Press, New York, 1990.

14

R. Bojanic and R. DeVore. On polynomials of best one sided approximation. Enseignement Math., 12:139-164, 1966.

15

Claude Brezinski. History of Continued Fractions and Padé Approximants. Number 12 in Springer Series in Computational Mathematics. Springer-Verlag, 1991.

16

Nigel J. Cutland. No longer ghosts -- the renaissance of infinitesimals. Mathematical Perspectives: Four Recent Inaugural Lectures, pages 43-74, 1990.

17

Keith J. Devlin. Constructibility. Springer-Verlag, Berlin, 1984.

18

Ronald DeVore. One-sided approximation of functions. Journal of Approximation Theory, 1:11-25, 1968.

19

J. K. S. Dewar. Procedures for interval arithmetic. Computing Journal, 14:447-450, 1970.

20

Herbert B. Enderton. A Mathematical Introduction to Logic. Academic Press, 24-28 Oval Road, London, NW1 7DX, 1972.

21

Milo  D. Ercegovac and Thomas Lang. On-line arithmetic: A design methodology and applications. VLSI Signal Processing III, pages 252-263, 1988.

22

C. T. Fike. Computer Evaluation of Mathematical Functions. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Englewood Cliffs, New Jersey, 1968.

23

Eugene L. Fiume. The Mathematical Structure of Raster Graphics. Academic Press, 1250 Sixth Avenue, San Diego, CA 92101, 1989.

24

James Foley, Andries van Dam, Steven Feiner, and John Hughes. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, Massachusetts, 2 edition, 1990.

25

Dr. G. Frege. The Foundations of Arithmetic. Northwestern University Press, Evanston, Illinois, 1950. English Translation by J. L. Austin.

26

Casper Goffman and George Pedrick. Real Functions. Prindle, Weber, and Schmidt, Boston, 1967.

27

D. I. Good and R. L. London. Computer interval arithmetic: Definition and proof of correct implementation. Journal of the Association for Computing Machinery, 17:603-612, 1970.

28

E. R. Hansen. A generalized interval arithmetic. In Interval Mathematics: Proceedings of the International Symposium, volume 29 of Lecture Notes In Computer Science, pages 7-18, Berlin, May 1975. Springer-Verlag.

29

J. G. Hayes, editor. Numerical Approximations to Functions and Data. The Athlone Press, University of London, 2 Gower Street London, 1970. Based on a conference organized by the Institute of Mathematics and Its Applications, Canterbury, England, 1967.

30

V. H. Hristov and K. G. Ivanov. Characterization of best approximations from below and above. Colloquia Mathematica Societis János Bolyai, 58:377-403, 1990.

31

Mary Jane Irwin and Robert Michael Owens. Fully digit on-line networks. IEEE Transactions on Computers, C-32(4):402-406, April 1983.

32

W. Kahan. A more complete interval arithmetic. Report, University of Toronto, 1968.

33

I.L. Kantor and A.S. Solodovnikov. Hypercomplex Numbers. Springer-Verlag, New York, 1989.

34

E. Kaucher. Interval analysis in the extended interval space . In Fundamentals of Numerical Computation, number 2 in Computing Supplementum, pages 33-49. Springer-Verlag, Wien, 1980.

35

Donald E. Knuth. The Art of Computer Programming: Seminumerical Algorithms, volume 2 of Computer Science and Information Processing. Addison-Wesley, Reading, Massachusetts, 1969.

36

Peter Kornerup and David W. Matula. Finite precision lexicographic continued fraction number systems. In Proceedings of Seventh Symposium on Computer Arithmetic, IEEE Symposium on Computer Arithmetic, pages 207-214, 1985.

37

U. Kulisch. An axiomatic approach to rounded computation. Numer. Math., 18:1-17, 1971.

38

U. Kulisch. Implementation and formalization of floating-point arithmetics. In Caratheodary Symposium, Athen, 1973.

39

U. Kulisch. On the concept of a screen. Z. Angew. Math. Mech., 53:115-119, 1973.

40

Ulrich Kulisch. A New Approach to Scientific Computation, chapter A New Arithmetic for Scientific Computation, pages 1-26. Academic Press, New York, 1983.

41

K. Kuratowski and A. Mostowski. Set Theory. North-Holland, Amsterdam, 1968.

42

B. A. Kushner. Lectures on Constructive Mathematical Analysis, volume 60. American Mathematical Society, Providence, Rhode Island, 1984.

43

Burkhard Lenze. On constructive one-sided spline approximation. Approximation Theory, 6(2):383-386, 1989.

44

James T. Lewis. Computation of best one-sided approximation. Mathematics of Computation, 24(111):529-536, July 1970.

45

James T. Lewis. Approximation with convex constraints. SIAM Review, 15(1):193-217, January 1973.

46

Lisa Lorentzen and Haakon Waadeland. Continued Fractions with Applications. Number 3 in Studies in Computational Mathematics. North-Holland, Amsterdam, 1992.

47

L. A. Lyusternik, O. A. Chervonenkis, and A. R. Yanpol'skii. Handbook for Computing Elementary Functions, volume 76 of International Series of Monographs in Pure and Applied Mathematics. Pergamon Press, London, 1965.

48

Jerrold E. Marsden and Anthony J. Tromba. Vector Calculus. W. H. Freeman and Company, New York, 3 edition, 1976.

49

Shouichi Matsui and Masao Iri. An overflow/underflow-free floating-point representation of numbers. Journal of Information Processing, 4(3):123-133, 1981.

50

David W. Matula. Towards an abstract mathematical theory of floating-point arithmetic. In 1969 Spring Joint Computer Conference, AFIPS Proceedings, pages 765-772, Montvale, New Jersey, 1969. AFIPS Press.

51

David W. Matula and Peter Kornerup. Finite precision rational arithmetic: Slash number systems. IEEE Transactions on Computers, C-34(1):3-18, January 1985.

52

W. L. Miranker. A New Approach to Scientific Computation, chapter Ultra-Arithmetic: The Digital Computer in Function Space, pages 165-198. Academic Press, New York, 1983.

53

W. L. Miranker and U. Kulisch. Computer arithmetic in theory and practice. Technical report, IBM Thomas K. Watson Research Center, Yorktown Heights, 1979. RC 7776 (33658), July 24, Mathematics.

54

Ieke Moerdijk and Gonzalo E. Reyes. Models for Smooth Infinitesimal Analysis. Springer-Verlag, New York, 1991.

55

R. E. Moore. Elements of Scientific Computing. Holt, New York, 1975.

56

Ramon E. Moore. Interval Analysis. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Englewood Cliffs, New Jersey, 1966.

57

Ramon E. Moore. Methods and Applications of Interval Analysis. SIAM Studies in Applied Mathematics. SIAM, Philadelphia, 1979.

58

George Pedrick. A First Course in Analysis. Springer-Verlag, New York, 1994.

59

Michael D. Potter. Sets, An Introduction. Oxford University Press, New York, 1990.

60

Marian Boykan Pour-El and Ian Richards. Computability and noncomputability in classical analysis. Transactions of the American Mathematical Society, 275(2):539-560, February 1983.

61

L. B. Rall. Computer Arithmetic and Self-Validating Numerical Methods, chapter Differentiation Arithmetics. Notes and Reports in Mathematics in Science and Engineering. Academic Press, New York, 1990.

62

H. G. Rice. Recursive real numbers. Proceedings of the American Mathematical Society, 5(5):784-791, 1954.

63

Alain Robert. Nonstandard Analysis. John Wiley & Sons, New York, 1988.

64

Walter Rudin. Principles of Mathematical Analysis. McGraw-Hill, New York, 1953.

65

Samuel Selby and Leonard Sweet. Sets--Relations--Functions. McGraw-Hill Book Company, New York, 1963.

66

John M. Snyder. Interval analysis for computer graphics. Computer Graphics, 26(2):121-129, July 1992.

67

Richard L. Tieszen. Mathematical Intuition. Kluwer Academic Publishers, P.O. Box 17, 3300 AA Dordrecht, The Netherlands, 1989.

68

Kishor S. Trivedi and Milo  D. Ercegovac. On-line algorithms for division and multiplication. IEEE Transactions on Computers, C-26(7):681-687, July 1977.

69

Jean E. Vuillemin. Exact real computer arithmetic with continued fractions. IEEE Transactions on Computers, 39(8):1087-1105, August 1990.

70

Wolfgang Warth. Approximation with constraints in normed linear spaces. Journal of Approximation Theory, 21:303-312, 1977.

71

J. H. Wilkinson. Rounding Errors in Algebraic Processes. Her Majesty's Stationary Office, London, 1968.

72

A. Young and E. A. Kiountouzis. Best approximation in an asymmetrically weighted measure. J. Inst. Maths. Applics., 24:379-394, 1979.

Jeff Tupper

March 1996