Reorthogonalized Pythagorean variants of block classical Gram-Schmidt
Erin Carson, Kathryn Lund, Yuxin Ma, Eda Oktay

TL;DR
This paper introduces and analyzes reorthogonalized Pythagorean variants of block classical Gram-Schmidt, improving orthogonality bounds and communication efficiency in distributed environments, with validation through theoretical analysis and numerical experiments.
Contribution
It presents two new reorthogonalized Pythagorean BCGS variants with better orthogonality bounds and communication properties, extending previous work to mixed-precision settings.
Findings
Achieved improved $O( ext{epsilon})$ orthogonality bounds.
Reduced synchronization points to two per block column.
Validated theoretical results with numerical experiments.
Abstract
Block classical Gram-Schmidt (BCGS) is commonly used for orthogonalizing a set of vectors in distributed computing environments due to its favorable communication properties relative to other orthogonalization approaches, such as modified Gram-Schmidt or Householder. However, it is known that BCGS (as well as recently developed low-synchronization variants of BCGS) can suffer from a significant loss of orthogonality in finite-precision arithmetic, which can contribute to instability and inaccurate solutions in downstream applications such as -step Krylov subspace methods. A common solution to improve the orthogonality among the vectors is reorthogonalization. Focusing on the "Pythagorean" variant of BCGS, introduced in [E. Carson, K. Lund, & M. Rozlo\v{z}n\'{i}k. SIAM J. Matrix Anal. Appl. 42(3), pp. 1365--1380, 2021], which guarantees an bound on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Rings, Modules, and Algebras
