Skip to main content

Approximate rational arithmetic systems: Analysis of recovery of simple fractions during expression evaluation

  • 9. Symbolic-Numeric Interface
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (EUROSAM 1979)

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

Included in the following conference series:

Abstract

Closed approximate rational arithmetic systems are described and their number theoretic foundations are surveyed. The arithmetic is shown to implicitly contain an adaptive single-to-double precision natural rounding behavior that acts to recover true simple fractional results. The probability of such recovery is investigated and shown to be quite favorable.

This research was supported in part by the National Science Foundation under Grant MCS77-21510.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bartley, D. H., The Utilization of Hybrid Techniques in Computer Systems for Symbolic Mathematics, Master's Thesis, Univ. Texas, Austin, 1972.

    Google Scholar 

  • Cabay, S. and Lam, T.P.L., "Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations," TOMS 3(1977), 386–397.

    Google Scholar 

  • Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers, Clarendon Press, Oxford, 1960.

    Google Scholar 

  • Horn, B. K. P., "Rational Arithmetic for Minicomputers," Software-Prac. and Exper. 8(1978), 171–176.

    Google Scholar 

  • Howell, J. and Gregory, R. T., "Solving Linear Equations Using Residue Arithmetic II," Nordisk Tidskr. Inf. 10(1970), 23–37.

    Google Scholar 

  • Knuth, D. E., The Art of Computer Programming, Vol. II, Addison-Wesley, Reading, 1969.

    Google Scholar 

  • Kornerup, P. and Matula, D. W., "A Feasibility Analysis of Fixed-Slash Rational Arithmetic," Proc. 4th Sym. on Comp. Arith., IEEE (1978), 39–47.

    Google Scholar 

  • Kulisch, U., "An Axiomatic Approach to Rounded Computations," Numerische Mathematik 18(1971), 1–17.

    Google Scholar 

  • Matula, D. W., "Fixed-Slash and Floating-Slash Rational Arithmetic," Proc. 3rd Sym. on Comp. Arith., IEEE (1975), 90–91.

    Google Scholar 

  • Matula, D. W. and Kornerup, P., "A Feasibility Analysis of Binary Fixed-Slash and Floating-Slash Number Systems," Proc. 4th Sym. on Comp. Arith., IEEE (1978), 29–38.

    Google Scholar 

  • Yun, D. and Gustavson, F., "Fast Computation of Rational Hermite Interpolants and Solving Toeplitz Systems of Equations via the Extended Euclidean Algorithm," this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Edward W. Ng

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matula, D.W., Kornerup, P. (1979). Approximate rational arithmetic systems: Analysis of recovery of simple fractions during expression evaluation. In: Ng, E.W. (eds) Symbolic and Algebraic Computation. EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09519-5_89

Download citation

  • DOI: https://doi.org/10.1007/3-540-09519-5_89

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09519-4

  • Online ISBN: 978-3-540-35128-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics