A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems

DOI10.1137/0904013MaRDI QIDQ3314860zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0904013

zbMATH Keywords

comparisonGaussian elimination with complete pivotingGivens rotationnormal equationsnumerical experimentsnumerical stabilitysparse least squares problems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25) Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 3844929
• Numerical Methods for Large Sparse Linear Least Squares Problems
• scientific article; zbMATH DE number 1222467
• scientific article; zbMATH DE number 4041162
• scientific article; zbMATH DE number 778128

Cited in

(14)

• Approximation by cubic C^ 1-splines on arbitrary triangulations
• Householder reflections versus Givens rotations in sparse orthogonal decomposition
• 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
• Solving large and sparse linear least-squares problems by conjugate gradient algorithms
• An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
• A parallel projection method for overdetermined nonlinear systems of equations
• Fitting scattered data on sphere-like surfaces using spherical splines
• An algorithm for solving sparse nonlinear least squares problems
• scientific article; zbMATH DE number 3844929 (Why is no real title available?)
• scientific article; zbMATH DE number 4041162 (Why is no real title available?)
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• A survey of direct methods for sparse linear systems
• The solution of large-scale least-squares problems on supercomputers

This page was built for publication: A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3314860)