ISSN:
1573-2878
Keywords:
Mathematical programming
;
conjugate-gradient methods
;
variable-metric methods
;
linear equations
;
numerical methods
;
computing methods
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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, wherem≤n, 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 rankn−m, 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00933852
Permalink
