Solution of sparse linear least squares problems using Givens rotations

DOI10.1016/0024-3795(80)90159-7zbMath0459.65025OpenAlexW2031629837MaRDI 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

zbMATH Keywords

normal equations Givens rotations orthogonal transformations sparse linear least squares problems

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Linear regression; mixed models (62J05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05)

Related Items (53)

Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations ⋮ Row-ordering schemes for sparse Givens transformations. II. Implicit graph model ⋮ Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem ⋮ Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement ⋮ A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ Householder reflections versus Givens rotations in sparse orthogonal decomposition ⋮ An extension of Karmarkar's algorithm for linear programming using dual variables ⋮ Linear algebra on high performance computers ⋮ Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems ⋮ Solving large and sparse linear least-squares problems by conjugate gradient algorithms ⋮ A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ Separators and structure prediction in sparse orthogonal factorization ⋮ An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems ⋮ Sparse linear problems and the least squares method ⋮ A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems ⋮ A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block ⋮ A direct method for sparse least squares problems with lower and upper bounds ⋮ Preconditioning techniques for nonsymmetric and indefinite linear systems ⋮ Class of optimization algorithms for the solution of large nonlinear programming problems. I ⋮ Matrix enlarging methods and their application ⋮ Solving sparse linear least-squares problems on some supercomputers by using large dense blocks ⋮ A decomposition method for solving a large-scale sparse system of linear equalities and inequalities by sequential quadratic programming ⋮ A hybrid algorithm for the solution of a single commodity spatial equilibrium model ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition ⋮ A direct method for the solution of sparse linear least squares problems ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ The solution of large-scale least-squares problems on supercomputers ⋮ Parallel QR Factorization of Block-Tridiagonal Matrices ⋮ Sparse matrices, and the estimation of variance components by likelihood methods ⋮ Solving combinatorial optimization problems using Karmarkar's algorithm ⋮ A note on the computation of an orthonormal basis for the null space of a matrix ⋮ A parallel projection method for overdetermined nonlinear systems of equations ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse QR factorization on a massively parallel computer ⋮ A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables ⋮ Combinatorial Aspects in Sparse Elimination Methods ⋮ Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model ⋮ Stability analysis of the method of seminormal equations for linear least squares problems ⋮ Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems ⋮ An algorithm for solving sparse nonlinear least squares problems ⋮ A class of incomplete orthogonal factorization methods. II: Implemetation and results ⋮ Use of the Gibbs sampler to invert large, possibly sparse, positive definite matrices ⋮ An algorithm to compute a sparse basis of the null space ⋮ Predicting the structure of sparse orthogonal factors ⋮ The projection method for solving nonlinear systems of equations under the most violated constraint control ⋮ Optimal matrix approximants in structural identification ⋮ A pipelined Givens method for computing the QR factorization of a sparse matrix ⋮ Rank and null space calculations using matrix decomposition without column interchanges ⋮ Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations

Uses Software

symrcm

Cites Work

This page was built for publication: Solution of sparse linear least squares problems using Givens rotations