Some Extensions of an Algorithm for Sparse Linear Least Squares Problems

DOI10.1137/0903014zbMath0483.65027MaRDI QIDQ3942314

Michael T. Heath

Publication date: 1982

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0903014

zbMATH Keywords

updating; sparse linear least squares problems; numerical rank determination; linear equality constrained problems; rank-deficient problems

Mathematics Subject Classification ID

62J05: Linear regression; mixed models

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65K05: Numerical mathematical programming methods

Related Items

Rank and null space calculations using matrix decomposition without column interchanges, Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations, An extension of Karmarkar's algorithm for linear programming using dual variables, Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks, Sparse linear problems and the least squares method, A direct method for sparse least squares problems with lower and upper bounds, Conical projection algorithms for linear programming, Fast orthogonal decomposition of rank deficient Toeplitz matrices, On stable least squares solution to the system of linear inequalities, Unnamed Item, Computing a Sparse Basis for the Null Space