Solution of linear least squares via the ABS algorithm
The authors consider the application of ABS methods to the solution of overdetermined linear systems \(Ax=b\) arising in least squares problems. The general class of ABS algorithms is described in the paper by \textit{J. Abaffy}, \textit{C. G. Broyden} and the first author [Numer. Math. 45, 361- 387 (1985; Zbl 0535.65009)]. This paper gives the specific form required for the least squares implementation, again using rank-one updates for the reflection matrix \(H\). Six implementations are briefly described and the second part describes the results of extensive numerical experiments with these implementations. The authors conclude that an explicit Gram-Schmidt factorization incorporated into a modified Huang algorithm generally gives better results than the NAG QR code, though the latter has smaller overheads.
- ABS algorithms for linear equations and optimization
- A code for linear least squares based upon the ABS procedure
- scientific article; zbMATH DE number 1552866
- scientific article; zbMATH DE number 822195
- scientific article; zbMATH DE number 727771
- scientific article; zbMATH DE number 2095775
- An Efficient Approach to the Linear Least Squares Problem
- scientific article; zbMATH DE number 800208
- The calculation of linear least squares problems
- A class of direct methods for linear systems
- A class of scaled direct methods for linear systems
- A direct method for the general solution of a system of linear equations
- Conjugate direction methods for solving systems of linear equations
- scientific article; zbMATH DE number 3677070 (Why is no real title available?)
- scientific article; zbMATH DE number 45283 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- Iterative refinement of linear least squares solutions II
- Numerical experiments with the symmetric algorithm in the ABS class for linear systems
- On the numerical stability of Huang's update
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Singular value decomposition and least squares solutions
- Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- The local convergence of ABS methods for nonlinear algebraic equations
- ABS algorithms for linear equations and optimization
- Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class
- scientific article; zbMATH DE number 1294401 (Why is no real title available?)
- A bibliography of the ABS methods
- A code for linear least squares based upon the ABS procedure
- ABS methods for continuous and integer linear equations and optimization
- Solving the linear least squares problem with very high relative accuracy
This page was built for publication: Solution of linear least squares via the ABS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803618)
