A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems

DOI10.1137/0907053zbMath0619.65030OpenAlexW2046711479MaRDI QIDQ3756407

Gene H. Golub, P. E. Manneback, Phillipe L. Toint

Publication date: 1986

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

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

zbMATH Keywords

projectionscomparisonorthogonal transformationproperty Apreconditioned conjugate gradientCPU timestorage requirementsdirect orthogonal decompositionDoppler positioning in Geodesyinput/output timeslarge dimensional least squares problemssparse linear least squares

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10) Geodesy, mapping problems (86A30)

Related Items

The solution of large-scale least-squares problems on supercomputers, A block algorithm for computing rank-revealing QR factorizations, On iterative algorithms for linear least squares problems with bound constraints, Parallel codes for computing the numerical rank