The Stability of Block Variants of Classical Gram--Schmidt
From MaRDI portal
Publication:3382789
DOI10.1137/21M1394424zbMath1476.65060OpenAlexW3198813152WikidataQ115155988 ScholiaQ115155988MaRDI QIDQ3382789
Erin Claire Carson, Miroslav Rozložnik, Kathryn Lund
Publication date: 22 September 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1394424
Related Items (4)
Optimal size of the block in block GMRES on GPUs: computational model and experiments ⋮ Adaptively restarted block Krylov subspace methods with low-synchronization skeletons ⋮ GMRES algorithms over 35 years ⋮ Block Gram-Schmidt algorithms and their stability properties
Uses Software
Cites Work
- Unnamed Item
- A note on the error analysis of classical Gram-Schmidt
- Reorthogonalized block classical Gram-Schmidt
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Determination of the inertia of a partitioned Hermitian matrix
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- A Newton basis GMRES implementation
- Accuracy and Stability of Numerical Algorithms
- Stability of block LU factorization
- Admissible and Attainable Convergence Behavior of Block Arnoldi and GMRES
- Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
This page was built for publication: The Stability of Block Variants of Classical Gram--Schmidt
