Solving large and sparse linear least-squares problems by conjugate gradient algorithms
From MaRDI portal
DOI10.1016/0898-1221(88)90170-8zbMATH Open0644.65028OpenAlexW2067576119MaRDI QIDQ1102707FDOQ1102707
Authors: B. George 
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
Recommendations
- Numerical Methods for Large Sparse Linear Least Squares Problems
- A modification of the conjugate gradient algorithm for the stable solution of ill posed problems of the least squares method
- Numerical aspects of the generalized CG-method applied to least squares problems
- scientific article; zbMATH DE number 1222467
- A note on the SOR and CG methods for large least squares problems
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Methods of conjugate gradients for solving linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Least Squares Computations by Givens Transformations Without Square Roots
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Title not available (Why is that?)
- 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
- Block Preconditioning for the Conjugate Gradient Method
- Direct methods for sparse matrices
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Numerical Methods for Large Sparse Linear Least Squares Problems
- Comparison of Two Algorithms for Solving Large Linear Systems
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- On General Row Merging Schemes for Sparse Givens Transformations
- Solution of sparse linear least squares problems using Givens rotations
- Comparison of two pivotal strategies in sparse plane rotations
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- Title not available (Why is that?)
- On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations
- General scheme for solving linear algebraic problems by direct methods
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- A direct method for the solution of sparse linear least squares problems
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- Title not available (Why is that?)
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Condition Number Estimators in a Sparse Matrix Software
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Conjugate gradients for symmetric positive semidefinite least-squares problems
- A modification of the conjugate gradient algorithm for the stable solution of ill posed problems of the least squares method
- A note on the SOR and CG methods for large least squares problems
- Krylov subspace estimation
- Solving Large Sparse Nonlinear Programs Using GRG
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- Title not available (Why is that?)
- Comparison of two pivotal strategies in sparse plane rotations
- A conjugate gradient algorithm for sparse linear inequalities
- Title not available (Why is that?)
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
- Solving large linear least squares problems with linear equality constraints
- Block conjugate gradient algorithms for least squares problems
- Title not available (Why is that?)
Uses Software
This page was built for publication: Solving large and sparse linear least-squares problems by conjugate gradient algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102707)
