Solution of Sparse Underdetermined Systems of Linear Equations

摘要

The problem of computing the minimum-norm solution to a sparse, underdetermined system of linear equations is considered. An algorithm is developed which is based on orthogonal factorization. The algorithm is generalized to cope with systems which are rank deficient, inconsistent, or require column updating. (ERA citation 08:048496)