Parallel complexity of Householder QR factorization
From MaRDI portal
Publication:4595495
Recommendations
- Parallel Complexity of Numerically Accurate Linear System Solvers
- Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
- On the parallel complexity of Gaussian elimination with pivoting
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- Parallel complexities and computations of cholesky's decomposition and QR factorization
Cited in
(5)- Parallel quadrant interlocking factorization on hypercube computers
- A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer
- Fast Parallel Algorithms for QR and Triangular Factorization
- Gaussian Elimination with Pivoting is P-Complete
- Hyperbolic Householder Algorithms for Factoring Structured Matrices
This page was built for publication: Parallel complexity of Householder QR factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595495)