On the parallel complexity of matrix factorization algorithms

Authors:
Mauro Leoncini;Giovanni Manzini;Luciano Margara
Affiliations:
Dipartmento di Informatica, Universita` di Pista, Corso Italia 40, 56125 Pisa, Itlay and IMC-CNR, Via S. Maria 46, 56126 Pisa, Italy;Dipartimento di scienze e Tecnologie Avanzate, Università di Torino, Via Cavour 84, 15100 Alessandria, Itlay and IMC-CNR, Via S. Maria 46, 56126 Pisa, Italy;Dipartmento di Scienze dell'Informazione, Università di Bologna, Mura Anteo Zambom 7, 40127 Bologna, Itlay
Venue:
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Year:
1997

Complexity of parallel matrix computations

Theoretical Computer Science
Gaussian elimination with pivoting is P-complete

SIAM Journal on Discrete Mathematics
LAPACK's user's guide

LAPACK's user's guide
O(log2 n) time efficient parallel factorization of dense, sparse separable, and banded matrices

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
How much can we speedup Gaussian elimination with pivoting?

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
The complexity of matrix rank and feasible systems of linear equations (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Stable Parallel Linear System Solvers

Journal of the ACM (JACM)
Parallel Complexity of Householder QR Factorization

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
LAPACK Working Note 53: Trading Off Parallelism and Numerical Stability

LAPACK Working Note 53: Trading Off Parallelism and Numerical Stability

Hi-index	0.00