Skip to main content
Log in

A direct method for the general solution of a system of linear equations

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A computationally stable method for the general solution of a system of linear equations is given. The system isA Tx−B=0, where then-vectorx is unknown and then×q matrixA and theq-vectorB are known. It is assumed that the matrixA T and the augmented matrix [A T,B] are of the same rankm, wheremn, so that the system is consistent and solvable. Whenm<n, the method yields the minimum modulus solutionx m and a symmetricn ×n matrixH m of ranknm, so thatx=x m+H my satisfies the system for ally, ann-vector. Whenm=n, the matrixH m reduces to zero andx m becomes the unique solution of the system.

The method is also suitable for the solution of a determined system ofn linear equations. When then×n coefficient matrix is ill-conditioned, the method can produce a good solution, while the commonly used elimination method fails.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Penrose, R.,A Generalized Inverse for Matrices, Proceedings of the Cambridge Philosophical Society, Vol. 51, pp. 406–413, 1955.

    Google Scholar 

  2. Ben-Israel, A., andCharnes, A.,Contributions to the Theory of Generalized Inverses, SIAM Journal on Applied Mathematics, Vol. 11, No. 3, 1963.

  3. Householder, A. S.,Unitary Triangularization of a Nonsymmetric Matrix, Journal of the Association for Computing Machinery, Vol. 5, No. 4, 1958.

  4. Ben-Israel, A., andWersan, S. J.,An Elimination Method for Computing the Generalized Inverse of an Arbitrary Complex Matrix, Journal of the Association for Computing Machinery, Vol. 10, No. 4, 1963.

  5. Golub, G.,Numerical Methods for Solving Linear Least Squares Problems, Numerische Mathematik, Vol. 7, No. 2, 1965.

  6. Noble, B.,A Method for Computing the Generalized Inverse of a Matrix, SIAM Journal on Numerical Analysis, Vol. 3, No. 4, 1966.

  7. Rust, B., Burrus, W. R., andSchneerberger, C.,A Simple Algorithm for Computing the Generalized Inverse of a Matrix, Communications of the ACM, Vol. 9, No. 5, 1966.

  8. Tewarson, R. P.,A Computational Method for Evaluating Generalized Inverses, Computer Journal, Vol. 10, No. 4, 1968.

  9. Peters, G., andWilkinson, J. H.,The Least Squares Problem and Pseudo-Inverses, Computer Journal, Vol. 13, No. 3, 1970.

  10. Gregory, R. T., andKarney, D. L.,A Collection of Matrices for Testing Computational Algorithms, John Wiley and Sons (Interscience Publishers), New York, New York, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by the National Science Foundation, Grant No. GP-41158.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, H.Y. A direct method for the general solution of a system of linear equations. J Optim Theory Appl 16, 429–445 (1975). https://doi.org/10.1007/BF00933852

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00933852

Key Words

Navigation