Abstract
An algorithm that uses integer arithmetic is suggested. It transforms anm ×n matrix to a diagonal form (of the structure of Smith Normal Form). Then it computes a reflexive generalized inverse of the matrix exactly and hence solves a system of linear equations error-free.
Similar content being viewed by others
References
Adegbeyeni E O and Krishnamurthy E V 1977Int. J. Systems Sci. 8 1181
Ben-Israel A and Greville T N E 1974Generalized Inverses: theory and applications (New York: Wiley-Interscience) p 94
Bowman V J and Burdet C A 1974SIAM J. Appl. Math. 26 120
Hurt M F and Waid C 1970SIAM J. Appl. Math. 19 547
Krishnamurthy E V and Sen S K 1976Computer-Based numerical Algorithms, (New Delhi: East-West)
Rao T M, Subramanian K and Krishnamurthy E V 1976SIAM J. Numer. Anal. 13 155
Sen S K and Shamim A A 1978J. Indian Inst. Sci. 60 111
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sen, S.K., Shamim, A.A. An integer arithmetic method to compute generalized matrix inverse and solve linear equations exactly. Proc. Indian Acad. Sci. (Math. Sci.) 87, 161–168 (1978). https://doi.org/10.1007/BF02837750
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02837750