Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
Michael T. Heath · SIAM Journal on Scientific and Statistical Computing · 1982
Several algorithms are developed which extend the method of George and Heath for sparse linear least squares problems to include rank-deficient problems, linear equality constrained problems, and updating of solutions. An application of these methods to the solution of sparse square nonsymmetric linear systems is also presented.