Solution of full and deficient rank linear equations
R. P. Tewarson, J. F. Jen
Abstract
R. P. Tewarson, J. F. Jen
Abstract
Abstract An algorithm for computing the solution of a linear system of algebraic equations is described. If the system is rank deficient, then the minimum norm least‐squares solution is obtained. The method utilizes Gaussian elimination with scaled partial pivoting and (in rank deficient case) orthogonal triangularizations on the remaining coefficient matrix.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract An algorithm for computing the solution of a linear system of algebraic equations is described. If the system is rank deficient, then the minimum norm least‐squares solution is obtained. The method utilizes Gaussian elimination with scaled partial pivoting and (in rank deficient case) orthogonal triangularizations on the remaining coefficient matrix.
Key concepts: Gaussian elimination, Coefficient matrix, Rank (graph theory), Mathematics, System of linear equations, Overdetermined system, Applied mathematics, Augmented matrix