Publication Date:
1996
Short description:
Parallel Complexity of Householder QR Factorization / Leoncini, Mauro; G., Manzini; L., Margara. - STAMPA. - 1136:(1996), pp. 290-301. ( 4th European Symposium on Algorithms Barcelona, Spain September 25-27, 1996) [10.1007/3-540-61680-2_61].
abstract:
Gaussian Elimination with Partial Pivoting and Householder QRfactorization are two very popular methods to solve linear systems.Implementations of these two methods are provided in state-of-the-artnumerical libraries and packages, such as LAPACK and MATLAB.Gaussian Elimination with Partial Pivoting was already known to beP-complete. Here we prove that the Householder QR factorization islikely to be inherently sequential as well. We also investigate theproblem of speedup vs non degeneracy and accuracy in numericalalgorithms.
Iris type:
Relazione in Atti di Convegno
Keywords:
parallel algorithms; computational complexity
List of contributors:
Leoncini, Mauro; G., Manzini; L., Margara
Book title:
Algorithms — ESA '96
Published in: