论文信息 - Error-free computation with rational numbers

Error-free computation with rational numbers

A method is described for doing error-free computation when the operands are rational numbers. A rational operanda/b is mapped onto the integer ¦a·b−1¦p and the arithmetic is performed inGF(p). A method is given for taking an integer result and finding its rational equivalent (the one which corresponds to the correct rational result).

Robert Todd Gregory

[1] M. Newman. Solving equations exactly , 1967 .

[2] E. V. Krishnamurthy,et al. Finite segmentp-adic number systems with applications to exact computation , 1975 .

[3] E. V. Krishnamurthy,et al. p-Adic arithmetic procedures for exact matrix computations , 1975 .

[4] S. Cabay,et al. Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations , 1977, TOMS.

[5] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .

[6] Jo Ann Howell,et al. Solving linear equations using residue arithmetic — Algorithm II , 1970 .

[7] I. Borosh,et al. Exact solutions of linear equations with rational coefficients by congruence techniques , 1966 .

[8] E. V. Krishnamurthy,et al. Residue Arithmetic Algorithms for Exact Computation of g-Inverses of Matrices , 1976 .

[9] Jo Ann Howell. Exact Solution of Linear Equations Using Residue Arithmetic [F4] (Algorithm 406) , 1971, Commun. ACM.

[10] Jo Ann Howell,et al. An algorithm for solving linear algebraic equations using residue arithmetic II , 1969 .