Solution of sparse linear least squares problems using Givens rotations
From MaRDI portal
Publication:1152201
DOI10.1016/0024-3795(80)90159-7zbMath0459.65025MaRDI QIDQ1152201
Publication date: 1980
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(80)90159-7
normal equations; Givens rotations; orthogonal transformations; sparse linear least squares problems
65D10: Numerical smoothing, curve fitting
62J05: Linear regression; mixed models
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65K05: Numerical mathematical programming methods
Related Items
A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables, Solving combinatorial optimization problems using Karmarkar's algorithm, A parallel projection method for overdetermined nonlinear systems of equations, Use of the Gibbs sampler to invert large, possibly sparse, positive definite matrices, Predicting the structure of sparse orthogonal factors, Optimal matrix approximants in structural identification, Separators and structure prediction in sparse orthogonal factorization, Matrix enlarging methods and their application, Solving sparse linear least-squares problems on some supercomputers by using large dense blocks, A hybrid algorithm for the solution of a single commodity spatial equilibrium model, Class of optimization algorithms for the solution of large nonlinear programming problems. I, A decomposition method for solving a large-scale sparse system of linear equalities and inequalities by sequential quadratic programming
Uses Software
