Affiliation:
1. School of Science Beijing University of Posts and Telecommunications Beijing China
Abstract
AbstractWe investigate a variant of the reorthogonalized block classical Gram–Schmidt method for computing the QR factorization of a full column rank matrix. Our aim is to bound the loss of orthogonality even when the first local QR algorithm is only conditionally stable. In particular, this allows the use of modified Gram–Schmidt instead of Householder transformations as the first local QR algorithm. Numerical experiments confirm the stable behavior of the new variant. We also examine the use of non‐QR local factorization and show by example that the resulting variants, although less stable, may also be applied to ill‐conditioned problems.
Funder
National Natural Science Foundation of China
Subject
Applied Mathematics,Algebra and Number Theory
Reference12 articles.
1. HoemmenM.Communication‐avoiding Krylov subspace methods [PhD dissertation]. Berkeley CA: UC Berkeley;2010.
2. ZouQ.GMRES algorithms over 35 years. arXiv preprint arXiv:2110.04017 2021.
3. The Stability of Block Variants of Classical Gram--Schmidt
4. Block Gram-Schmidt algorithms and their stability properties
5. Gram-Schmidt orthogonalization: 100 years and more