Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study
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.
scientific article; zbMATH DE number 428195