Abstract
In a previous paper, which appeared in two parts, Algorithm I was described. (See [1] and [2] for details). Algorithm II differs from Algorithm I in that the Chinese Remainder Theorem is not used whenever it is necessary to reconstruct a unique integer from its residue representation. Instead, the residue representation is converted to asymmetric residue representation and then the symmetric residue representation is converted to its associatedsymmetric mixed-radix representation, from which the unique integer can be reconstructed in an easy manner. This procedure has advantages over the procedure using the Chinese Remainder Theorem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Howell, J. A., and R. T. Gregory,An Algorithm for Solving Linear Algebraic Equations Using Residue Arithmetic I, BIT 9 (1969), 200–224.
Howell, J. A. and R. T. Gregory,An Algorithm for Solving Linear Algebraic Equations Using Residue Arithmetic II, BIT 9 (1969), 324–337.
Szabó, N. S., and R. I. Tanaka,Residue Arithmetic and Its Applications to Computer Technology, New York, McGraw-Hill, 1967.
Lindamood, G. E.,Numerical Analysis in Residue Number Systems, University of Maryland Computer Science Center Report TR-64-7, College Park, Maryland, 1964.
Takahasi, H., and Y. Ishibashi,A New Method for ‘Exact Calculation’ by a Digital Computer, Information Processing in Japan 1 (1961), 28–42.
Lotkin, M.,A Set of Test Matrices, Mathematics of Computation 9 (1955), 153–161.
Howell, J. A., and R. T. Gregory,Solving Linear Equations Using Residue Arithmetic-Algorithm II, The University of Texas Computation Center Report TNN-95, Austin, 1969.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Howell, J.A., Gregory, R.T. Solving linear equations using residue arithmetic — Algorithm II. BIT 10, 23–37 (1970). https://doi.org/10.1007/BF01940889
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01940889