Numerical experiments with the symmetric algorithm in the ABS class for linear systems
From MaRDI portal
Publication:4725609
DOI10.1080/02331938708843232zbMath0616.65032MaRDI QIDQ4725609
No author found.
Publication date: 1987
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938708843232
conjugate gradient method; numerical comparisons; ill-conditioning; Brown and Brent type methods; Gram- Schmidt method; orthogonal factorization methods; QR- methods; symmetric implementations of Abaffy-Broyden-Spedicato (ABS) type algorithms; symmetric rank one updates; testing of numerical methods
65F10: Iterative numerical methods for linear systems
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
A bibliography of the ABS methods, A code for linear least squares based upon the ABS procedure, Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study, A class of scaled direct methods for linear systems, Optimally conditioned scaled ABS algorithms for linear systems, Solution of linear least squares via the ABS algorithm, Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class, An algorithm for solving determined or undetermined, pull or deficient rank linear systems based upon the optimally conditioned ABS algorithm
Cites Work
