Numerical experiments with the symmetric algorithm in the ABS class for linear systems

DOI10.1080/02331938708843232zbMath0616.65032OpenAlexW1970632611MaRDI 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

zbMATH Keywords

conjugate gradient methodnumerical comparisonsill-conditioningBrown and Brent type methodsGram- Schmidt methodorthogonal factorization methodsQR- methodssymmetric implementations of Abaffy-Broyden-Spedicato (ABS) type algorithmssymmetric rank one updatestesting of numerical methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (8)

An algorithm for solving determined or undetermined, pull or deficient rank linear systems based upon the optimally conditioned ABS algorithm ⋮ A bibliography of the ABS methods ⋮ Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study ⋮ Solution of linear least squares via the ABS algorithm ⋮ Optimally conditioned scaled ABS algorithms for linear systems ⋮ A class of scaled direct methods for linear systems ⋮ A code for linear least squares based upon the ABS procedure ⋮ Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class

Cites Work

• Unnamed Item
• A class of direct methods for linear systems

This page was built for publication: Numerical experiments with the symmetric algorithm in the ABS class for linear systems