Reorthogonalized block classical Gram-Schmidt using two Cholesky-based TSQR algorithms
From MaRDI portal
Publication:6592218
DOI10.1137/23m1605387zbMATH Open1545.65171MaRDI QIDQ6592218
Publication date: 24 August 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
block matricescondition numbersQR factorizationGram-Schmidt processrounding error analysistall skinny QR factorization
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some metrical properties of operator matrices and matrices partitioned into blocks
- A note on the error analysis of classical Gram-Schmidt
- Roundoff error analysis of the CholeskyQR2 algorithm
- Numerics of Gram-Schmidt orthogonalization
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Reorthogonalized block classical Gram-Schmidt
- Block Gram-Schmidt algorithms and their stability properties
- Block Gram-Schmidt downdating
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- A floating-point technique for extending the available precision
- Improved Gram-Schmidt type downdating methods
- Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
- The Stability of Block Variants of Classical Gram--Schmidt
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- A set of level 3 basic linear algebra subprograms
- Accuracy and Stability of Numerical Algorithms
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- Block Gram–Schmidt Orthogonalization
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Experiments on Gram-Schmidt Orthogonalization
- Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
- Randomized Gram--Schmidt Process with Application to GMRES
- Probabilistic Rounding Error Analysis of Householder QR Factorization
This page was built for publication: Reorthogonalized block classical Gram-Schmidt using two Cholesky-based TSQR algorithms