Numerical methods for large sparse linear least squares problems
Large sparse least squares problems arise in many applications, including geodetic network adjustments and finite element structural analysis. Although geodesists and engineers have been solving such problems for years, it is only relatively recently that numerical analysts have turned attention to them. In this paper a survey of numerical methods for large sparse linear least squares problems is presented, focusing mainly on developments since the last comprehensive surveys of the subject published in 1976. Direct methods were considered based on elimination and on orthogonalization, as well as various iterative methods. The ramifications of rank deficiency, constraints, and updating are also discussed.
- Research Organization:
- Oak Ridge National Lab., TN
- DOE Contract Number:
- W-7405-ENG-26
- OSTI ID:
- 6126540
- Journal Information:
- SIAM J. Sci. Stat. Comput.; (United States), Vol. 5:3
- Country of Publication:
- United States
- Language:
- English
Similar Records
A scheme for handling rank deficiency in the solution of sparse linear least squares problems
Least-squares adjustment of large-scale geodetic networks by orthogonal decomposition