Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
From MaRDI portal
Publication:3942314
DOI10.1137/0903014zbMath0483.65027OpenAlexW2043662633MaRDI QIDQ3942314
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
updatingsparse linear least squares problemsnumerical rank determinationlinear equality constrained problemsrank-deficient problems
Linear regression; mixed models (62J05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05)
Related Items
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, A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, 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, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, Computing a Sparse Basis for the Null Space, Matrix stretching for sparse least squares problems, On stable least squares solution to the system of linear inequalities, Fast orthogonal decomposition of rank deficient Toeplitz matrices, A survey of direct methods for sparse linear systems, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, Solving large linear least squares problems with linear equality constraints, Rank and null space calculations using matrix decomposition without column interchanges
