@inproceedings{0a3257976f10400c9edaf3698ee73caa,
title = "Parallel complexity of householder QR factorization",
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.",
author = "Mauro Leoncini and Giovanni Manzini and Luciano Margara",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; 4th European Symposium on Algorithms, ESA 1996 ; Conference date: 25-09-1996 Through 27-09-1996",
year = "1996",
doi = "10.1007/3-540-61680-2_63",
language = "English",
isbn = "3540616802",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "290--301",
editor = "Josep Diaz and Maria Serna",
booktitle = "Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings",
address = "Germany",
}