Parallel complexity of Householder QR factorization
From MaRDI portal
Publication:4595495
DOI10.1007/3-540-61680-2_63zbMATH Open1380.65062OpenAlexW1782376305MaRDI QIDQ4595495FDOQ4595495
Authors: Giovanni Manzini, Luciano Margara, Mauro Leoncini 
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_63
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
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20)
Cited In (5)
- Hyperbolic Householder Algorithms for Factoring Structured Matrices
- Fast Parallel Algorithms for QR and Triangular Factorization
- A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer
- Parallel quadrant interlocking factorization on hypercube computers
- Gaussian Elimination with Pivoting is P-Complete
Uses Software
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)
