Parallel complexity of Householder QR factorization

DOI10.1007/3-540-61680-2_63MaRDI QIDQ4595495zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20)

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

Describes a project that uses

Uses Software

• LAPACK
• Matlab

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)