Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage

DOI10.1137/0902034zbMath0469.65021OpenAlexW1984230747MaRDI QIDQ3923510

No author found.

Publication date: 1981

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

Full work available at URL: https://www.osti.gov/biblio/5171529

zbMATH Keywords

orthogonal decompositionlarge sparse linear least squares problemsphotogrammetryauxiliary storageearthquake studiesgeodetic network adjustmentsincomplete nested dissection

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05) Geodesy, mapping problems (86A30) Geophysical solid mechanics (74L05) Orthogonalization in numerical linear algebra (65F25)

Related Items (12)

Linear algebra on high performance computers ⋮ 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 ⋮ Sparse linear problems and the least squares method ⋮ Solution of sparse linear least squares problems using Givens rotations ⋮ A survey of direct methods for sparse linear systems ⋮ Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model ⋮ Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999 ⋮ Dedication to Robert J. Plemmons ⋮ An algorithm to compute a sparse basis of the null space ⋮ A pipelined Givens method for computing the QR factorization of a sparse matrix

This page was built for publication: Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage