Solution of linear least squares via the ABS algorithm
From MaRDI portal
Publication:1803618
DOI10.1007/BF01581261zbMath0771.65020OpenAlexW2054473470MaRDI QIDQ1803618
Publication date: 29 June 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581261
numerical experimentsleast squares problemsABS methodsoverdetermined linear systemsHuang algorithmGram-Schmidt factorizationrank- one updates
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05)
Related Items (4)
ABS methods for continuous and integer linear equations and optimization ⋮ A bibliography of the ABS methods ⋮ Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class ⋮ ABS algorithms for linear equations and optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of scaled direct methods for linear systems
- A class of direct methods for linear systems
- On the numerical stability of Huang's update
- The local convergence of ABS methods for nonlinear algebraic equations
- A direct method for the general solution of a system of linear equations
- Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class
- Singular value decomposition and least squares solutions
- Conjugate direction methods for solving systems of linear equations
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Numerical experiments with the symmetric algorithm in the ABS class for linear systems
- Iterative refinement of linear least squares solutions II
- Solving linear least squares problems by Gram-Schmidt orthogonalization
This page was built for publication: Solution of linear least squares via the ABS algorithm