Abstract
Ganssian Elimination with Partial Pivoting and Householder QR factorization are two very popular methods to solve linear systems. Implementations of these two methods are provided in state-of-the-art numerical libraries and packages, such as LAPACK and MATLAB. Ganssian Elimination with Partial Pivoting was already known to be Pcomplete. Here we prove that the Householder QR factorization is likely to be inherently sequential as well. We also investigate the problem of speedup vs non degeneracy and accuracy in numerical algorithms.
Cite
CITATION STYLE
Leoncini, M., Manzini, G., & Margara, L. (1996). Parallel complexity of householder QR factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 290–301). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
