Block Gram-Schmidt algorithms and their stability properties
From MaRDI portal
Publication:2074959
DOI10.1016/j.laa.2021.12.017zbMath1490.65074arXiv2010.12058OpenAlexW4200578327MaRDI QIDQ2074959
Publication date: 11 February 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.12058
Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items
GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems, Mixed precision algorithms in numerical linear algebra, BlockStab, Adaptively restarted block Krylov subspace methods with low-synchronization skeletons, GMRES algorithms over 35 years, A Block Minimum Residual Norm Subspace Solver with Partial Convergence Management for Sequences of Linear Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restarted block-GMRES with deflation of eigenvalues
- Backward error analysis of the AllReduce algorithm for Householder QR decomposition
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- A note on the error analysis of classical Gram-Schmidt
- Roundoff error analysis of the CholeskyQR2 algorithm
- Updating the QR decomposition of block tridiagonal and block Hessenberg matrices
- Numerical aspects of Gram-Schmidt orthogonalization of vectors
- Iterative algorithms for Gram-Schmidt orthogonalization
- The block conjugate gradient algorithm and related methods
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- A projection method for generalized eigenvalue problems using numerical integration.
- Reorthogonalized block classical Gram-Schmidt
- KSPHPDDM and PCHPDDM: extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Convergence properties of block GMRES and matrix polynomials
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- A Krylov--Schur Algorithm for Large Eigenproblems
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Efficient and Stable Arnoldi Restarts for Matrix Functions Based on Quadrature
- Gram-Schmidt orthogonalization: 100 years and more
- Deflated Restarting for Matrix Functions
- Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
- The Stability of Block Variants of Classical Gram--Schmidt
- Implementation of the GMRES Method Using Householder Transformations
- Recycling Krylov Subspaces for Sequences of Linear Systems
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Accuracy and Stability of Numerical Algorithms
- When modified Gram-Schmidt generates a well-conditioned set of vectors
- Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
- Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
- Block Gram–Schmidt Orthogonalization
- Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- On Improving Linear Solver Performance: A Block Variant of GMRES
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
- Low synchronization Gram–Schmidt and generalized minimal residual algorithms
