The solution of large-scale least-squares problems on supercomputers

DOI10.1007/BF02023055zbMath0705.90064OpenAlexW1992181267MaRDI QIDQ918420

Iain S. Duff

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023055

zbMATH Keywords

supercomputerslarge-scale sparse least-squares problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Least squares and related methods for stochastic control systems (93E24) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A survey of direct methods for sparse linear systems, A new class of preconditioners for large-scale linear systems from interior point methods for linear programming

Uses Software

• LSQR
• Harwell-Boeing sparse matrix collection
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On the augmented system approach to sparse least-squares problems
• Solution of sparse linear least squares problems using Givens rotations
• A direct method for the solution of sparse linear least squares problems
• A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Numerical Methods for Large Sparse Linear Least Squares Problems
• On the Method of Weighting for Equality-Constrained Least-Squares Problems
• A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
• Sparse matrix test problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Iterative refinement of linear least squares solutions I
• The least squares problem and pseudo-inverses