A note on the modified gram-schmidt process
An algorithm, based on the usual modified Gram-Schmidt process with column pivoting, for computing the minimum norm least squares solution to \(\| Ax-b\|_ 2\) is suggested. The idea is to first compute a so- called basic solution, and then deflate this solution with respect to the null-space of A. Rank determination as well as deflation is performed in the `textbook sense' without paying attention to numerical difficulties, and a sentence like ``... we had to go to double precision arithmetic to ensure sufficient significant digits suggests that the algorithm is not numerically stable.
- Roundoff error estimates of the modified Gram-Schmidt algorithm with column pivoting
- A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting
- scientific article; zbMATH DE number 32256
- On best least square solutions of two-point boundary value problems via modified Gram-Schmidt process
- A numerically stable block modified Gram-Schmidt algorithm solving stiff weighted least squares problems
- On the method of complementary functions for linear and nonlinear two- point boundary value problems
- On best least square solutions of two-point boundary value problems via modified Gram-Schmidt process
- Roundoff error estimates of the modified Gram-Schmidt algorithm with column pivoting
- On growth factors of the modified Gram-Schmidt algorithm
- When modified Gram-Schmidt generates a well-conditioned set of vectors
- A numerically stable block modified Gram-Schmidt algorithm solving stiff weighted least squares problems
This page was built for publication: A note on the modified gram-schmidt process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806679)