Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study (Q686341)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study |
scientific article; zbMATH DE number 428195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study |
scientific article; zbMATH DE number 428195 |
Statements
Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study (English)
0 references
13 October 1993
0 references
Results of extensive numerical experiments with algorithms for linear systems based on \(LQ\), \(QR\), and Huang type methods are presented. It is shown that the best modified Huang algorithms are essentially as good as the doubly iterated Gram-Schmidt algorithm, applied on the rows of the coefficient matrix and coupled with the \(ABS\) update formula. They are generally more accurate than the stabilized Gram-Schmidt algorithm and the algorithms based on the \(QR\) factorization.
0 references
ill-conditioned equations
0 references
\(QR\) method
0 references
\(LQ\) method
0 references
Huang methods
0 references
numerical experiments
0 references
algorithms
0 references
Huang algorithms
0 references
Gram-Schmidt algorithm
0 references
\(ABS\) update formula
0 references
0 references
0 references
