A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
From MaRDI portal
Publication:3314860
DOI10.1137/0904013zbMath0532.65027OpenAlexW2092199786MaRDI QIDQ3314860
No author found.
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
comparisonnumerical experimentsnumerical stabilitynormal equationsGivens rotationsparse least squares problemsGaussian elimination with complete pivoting
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)
Related Items
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, The solution of large-scale least-squares problems on supercomputers, A parallel projection method for overdetermined nonlinear systems of equations, A survey of direct methods for sparse linear systems, Fitting scattered data on sphere-like surfaces using spherical splines, An algorithm for solving sparse nonlinear least squares problems
