Abstract
Part I contained an algorithm for solvingAx=b using single-modulus residue arithmetic. Part II contains a description of the algorithm when more than one modulus is used. There is a discussion of how to select the moduli along with some numerical results. There is a sketch of this procedure in Newman [1]. However, the treatment here is complete and uses the notation of Szabó and Tanaka [2]. It lays the foundation for a subsequent paper which will extend these results.
Similar content being viewed by others
References
Newman, M.,Solving Equations Exactly, Jour. Res. N.B.S., v. 17B (1967), pp. 171–179.
Szabó, S., and R. Tanaka,Residue Arithmetic and Its Applications to Computer Technology, New York, McGraw Hill, 1967.
Howell, J. A., and R. T. Gregory,Solving Systems of Linear Algebraic Equations Using Residue Arithmetic, University of Texas Computation Center Report TNN-82 (revised), Austin, 1969.
Borosh, I., and A. S. Fraenkel,Exact Solutions of Linear Equations with Rational Coefficients by Congruence Techniques, Math. of Comp. 20 (1966), pp. 107–112.
Todd, John,Survey of Numerical Analysis, New York, McGraw-Hill, 1962, p. 242.
Lietzke, M. H., R. W. Stoughton, and Marjorie P. Lietzke,A Comparison of Several Methods for Inverting Large Symmetric Positive Matrices, Math. of Comp. 18 (1964), pp. 449–456.
Gregory, R. T., and D. L. Karney,A Collection of Matrices for Testing Computational Algorithms, New York, Wiley, 1969.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Howell, J.A., Gregory, R.T. An algorithm for solving linear algebraic equations using residue arithmetic II. BIT 9, 324–337 (1969). https://doi.org/10.1007/BF01935864
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01935864