Solving large and sparse linear least-squares problems by conjugate gradient algorithms

DOI10.1016/0898-1221(88)90170-8MaRDI QIDQ1102707zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

conjugate gradient algorithmdecomposition techniqueNumerical examplesLarge and sparse least squares problems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

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

Cites work

• scientific article; zbMATH DE number 3883496 (Why is no real title available?)
• scientific article; zbMATH DE number 3854346 (Why is no real title available?)
• scientific article; zbMATH DE number 4215266 (Why is no real title available?)
• scientific article; zbMATH DE number 3923962 (Why is no real title available?)
• scientific article; zbMATH DE number 4041162 (Why is no real title available?)
• scientific article; zbMATH DE number 3748409 (Why is no real title available?)
• scientific article; zbMATH DE number 3523042 (Why is no real title available?)
• scientific article; zbMATH DE number 3438258 (Why is no real title available?)
• scientific article; zbMATH DE number 3444086 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3111121 (Why is no real title available?)
• A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
• A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
• 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
• A direct method for the solution of sparse linear least squares problems
• An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
• Block Preconditioning for the Conjugate Gradient Method
• Comparison of Two Algorithms for Solving Large Linear Systems
• Comparison of two pivotal strategies in sparse plane rotations
• Condition Number Estimators in a Sparse Matrix Software
• Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
• Direct methods for sparse matrices
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• General scheme for solving linear algebraic problems by direct methods
• Least Squares Computations by Givens Transformations Without Square Roots
• Methods of conjugate gradients for solving linear systems
• Numerical Methods for Large Sparse Linear Least Squares Problems
• Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
• On General Row Merging Schemes for Sparse Givens Transformations
• On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
• Solution of sparse linear least squares problems using Givens rotations
• Solving large and sparse linear least-squares problems by conjugate gradient algorithms

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
• scientific article; zbMATH DE number 3911583 (Why is no real title available?)
• Comparison of two pivotal strategies in sparse plane rotations
• A conjugate gradient algorithm for sparse linear inequalities
• A class of incomplete orthogonal factorization methods. II: Implemetation and results
• scientific article; zbMATH DE number 4092656 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1782362 (Why is no real title available?)

Describes a project that uses

Uses Software

• LINPACK

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)