Iterative algorithms for Gram-Schmidt orthogonalization

DOI10.1007/BF02241222zbMath0667.65037MaRDI QIDQ1117669

Walter Hoffmann

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

Gram-Schmidt orthogonalization; QR factorization; Gram-Schmidt algorithm; vector algorithms

Mathematics Subject Classification ID

15A23: Factorization of matrices

65G50: Roundoff error

65F25: Orthogonalization in numerical linear algebra

Related Items

Unnamed Item, Unnamed Item, ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS, Unnamed Item, Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study, The loss of orthogonality in the Gram-Schmidt orthogonalization process, A note on the error analysis of classical Gram-Schmidt, Solving large dense systems of linear equations on systems with virtual memory and with cache, On the stable implementation of the generalized minimal error method, Numerics of Gram-Schmidt orthogonalization, One-sided reduction to bidiagonal form, Numerical stability of GMRES, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, The influence of orthogonality on the Arnoldi method, A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting, Rounding error analysis of the classical Gram-Schmidt orthogonalization process, Improved Gram-Schmidt type downdating methods

Cites Work

• Unnamed Item
• Unnamed Item
• Rang revealing QR factorizations
• Numerical aspects of Gram-Schmidt orthogonalization of vectors
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Solving linear least squares problems by Gram-Schmidt orthogonalization