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

DOI10.1137/0907053MaRDI QIDQ3756407zbMATHOpenAlexFDO

Authors Gene H. Golub, P. E. Manneback, Philippe 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 optimization and variational techniques (65K10) Geodesy, mapping problems (86A30) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 3901913
• A Modification of an Algorithm by Golub and Plemmons for Large Linear Least Squares in the Context of Doppler Positioning
• Numerical Methods for Large Sparse Linear Least Squares Problems
• Convergence of a direct-iterative method for large-scale least-squares problems
• Extrapolated Gauss-Seidel I and SOR methods for least-squares problems

Cited in

(9)

• Parallel codes for computing the numerical rank
• A Modification of an Algorithm by Golub and Plemmons for Large Linear Least Squares in the Context of Doppler Positioning
• On iterative algorithms for linear least squares problems with bound constraints
• Comparisons of spectral techniques for geoid computations over large regions
• A block algorithm for computing rank-revealing QR factorizations
• scientific article; zbMATH DE number 3901913 (Why is no real title available?)
• Integration of the Monte Carlo covariance estimation strategy into tailored solution procedures for large-scale least squares problems
• The solution of large-scale least-squares problems on supercomputers
• Approximate solution of normal equations by eigenvalue decomposition

This page was built for publication: A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems

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