Backward error analysis of the AllReduce algorithm for Householder QR decomposition
From MaRDI portal
(Redirected from Publication:692038)
Recommendations
- Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
- Parallel algorithms for QR decomposition on a shared memory multiprocessor
- Probabilistic Rounding Error Analysis of Householder QR Factorization
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- A Componentwise Perturbation Analysis of the $QR$ Decomposition
Cites work
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Algorithm 807
- Communication-optimal parallel and sequential QR and LU factorizations
- Templates for the Solution of Algebraic Eigenvalue Problems
- The block conjugate gradient algorithm and related methods
- Very large electronic structure calculations using an out-of-core filter-diagonalization method
Cited in
(5)- Roundoff error analysis of the CholeskyQR2 algorithm in an oblique inner product
- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
- Probabilistic Rounding Error Analysis of Householder QR Factorization
- Rounding error analysis of mixed precision block Householder QR algorithms
- Block Gram-Schmidt algorithms and their stability properties
This page was built for publication: Backward error analysis of the AllReduce algorithm for Householder QR decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692038)