Abstract
We propose a numerical algorithm for finding the normal solution of consistent systems of linear algebraic equations of incomplete rank of rows. Results of a comparison of a numerical realization of the proposed algorithm with some known subroutines are given.
Similar content being viewed by others
References
O. V. Bartenev, Fortran for Professionals. Mathematical Library IMSL [in Russian], Pt. 1, Dialog-MIFI, Moscow (2000).
J. W. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia (1997).
V. N. Faddeeva and L. J. Kolotilina, Numerical Methods of Linear Algebra. A Set of Matrices for Testing [in Russian], issues I–III, LOMI, Leningrad (1982).
G. H. Golub and C. F. van Loan, Matrix Computations John Hopkins Univ. Press, Baltimore (1989).
M. V. Lezhnev, “A diagonalization method for solution of rectangular systems of linear equations,” in: Lectures of Instructors and Abstracts of Young Scientists of the Int. Summer School “Iterative Methods and Matrix Computations,” RSU, Rostov-on-Don (2002), pp. 431–433.
M. V. Lezhnev, “The minimal solution of systems of linear equations with full rank of rows,” in: Proc. X All-Russia Schools-Seminar “Modern Problems of Mathematical Modelling” [in Russian], RSU, Rostov-on-Don (2004), pp. 151–155.
V. V. Voevodin and Yu. A. Kuznetsov, Matrices and Calculations [in Russian], Nauka, Moscow (1984).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 14, No. 2, pp. 121–128, 2008.
Rights and permissions
About this article
Cite this article
Lezhnev, M.V. An algorithm for finding normal solutions of consistent systems of linear equations. J Math Sci 162, 669–674 (2009). https://doi.org/10.1007/s10958-009-9653-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-009-9653-2