Solving large and sparse linear least-squares problems by conjugate gradient algorithms
From MaRDI portal
Publication:1102707
DOI10.1016/0898-1221(88)90170-8zbMath0644.65028OpenAlexW2067576119MaRDI QIDQ1102707
Publication date: 1988
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90170-8
conjugate gradient algorithmdecomposition techniqueNumerical examplesLarge and sparse least squares problems
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items (5)
Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Solving large and sparse linear least-squares problems by conjugate gradient algorithms ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ A class of incomplete orthogonal factorization methods. II: Implemetation and results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General scheme for solving linear algebraic problems by direct methods
- Direct methods for sparse matrices
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Solution of sparse linear least squares problems using Givens rotations
- A direct method for the solution of sparse linear least squares problems
- Comparison of two pivotal strategies in sparse plane rotations
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Block Preconditioning for the Conjugate Gradient Method
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Numerical Methods for Large Sparse Linear Least Squares Problems
- Condition Number Estimators in a Sparse Matrix Software
- On General Row Merging Schemes for Sparse Givens Transformations
- A Modified Upwind Scheme for Convective Transport Equations and the Use of a Conjugate Gradient Method for the Solution of Non-Symmetric Systems of Equations
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- Comparison of Two Algorithms for Solving Large Linear Systems
- On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- Least Squares Computations by Givens Transformations Without Square Roots
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Solving large and sparse linear least-squares problems by conjugate gradient algorithms
