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

DOI10.1137/0902034MaRDI QIDQ3923510zbMATH OpenOpenAlexFDO

Authors

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

auxiliary storageearthquake studiesgeodetic network adjustmentsincomplete nested dissectionlarge sparse linear least squares problemsorthogonal decompositionphotogrammetry

Mathematics Subject Classification ID

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

Cited in

(12)

• A pipelined Givens method for computing the QR factorization of a sparse matrix
• 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
• Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999
• Dedication to Robert J. Plemmons
• A survey of direct methods for sparse linear systems
• Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
• An algorithm to compute a sparse basis of the null space

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

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