A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting (Q1978115): Difference between revisions
From MaRDI portal
Latest revision as of 15:29, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting |
scientific article |
Statements
A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting (English)
0 references
18 July 2002
0 references
A row oriented version of the modified Gram-Schmidt orthogonalization process for computing the QR-factorization of a matrix is implemented that incorporates column pivoting and is capable of iterative orthogonalization. In addition to introducing the algorithm, the author also discusses related issues such as the need for reorthogonalization, connections with other orthogonalization techniques, and an error analysis. In addition, a modification of the standard least-squares algorithm is proposed that leads to certain desirable scaling properties of the computed residual.
0 references
modified Gram-Schmidt method
0 references
column pivoting
0 references
reorthogonalization
0 references
QR-factorization
0 references
algorithm
0 references
error analysis
0 references
least-squares algorithm
0 references
0 references
0 references
