Parallel complexity of householder QR factorization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 290-301

  Leoncini, Mauro ^a   Manzini, Giovanni ^a,b   Margara, Luciano ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; NUMERICAL METHODS;

NON-DEGENERACY; NUMERICAL ALGORITHMS; NUMERICAL LIBRARY; P-COMPLETE; PARALLEL COMPLEXITY; QR FACTORIZATIONS; STATE OF THE ART;

FACTORIZATION;

EID: 0343017777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_63     Document Type: Conference Paper

References (11)

1. Anderson, E. et al. Lapack User's Guide, (Society for Industrial and Applied Mathematics, Philadelphia, 1992).
2. Csanky, L., Fast parallel matrix inversion algorithms, SIAM J. Comput. 5 (1976) 618-623.
3. Demmel, J. W., Trading off parallelism and numerical accuracy, Tech. Rep. CS- 92-179, Univ. of Tennessee, June 1992 (Lapack Working Note 52).
4. Golub, G. H. and C. F. Van Loan, Matrix Computations (The Johns Hopkins University Press, Baltimore, 1989).
5. Greenlaw, R., H. J. Hoover, and W. L. Ruzzo, A Compendium of Problems Complete for P, Technical Report 91-05-01, Dept. of Computer Science and Engineering, University of Washington (1991).
6. Hoover, H. J., M. M. Klawe, and N. Pippenger, Bounding Fan-out in Logical Networks, J. ACM 31 (1984) 13-18.
7. Ladner, R. E., The Circuit Value Problem is Log Space Complete for P, SIGACT News 7 (1975) 18-20.
8. Leoncini, M., How Much Can We Speedup Gaussian Elimination with Pivoting? in: Proc. 6th ACM Syrup. on Parallel Algorithms and Architectures (1994) 290-297. Journal of Computer and System Sciences, to appear.
9. Pan, V., Complexity of Parallel Matrix Computations, Theoretical Computer Science. 54 (1987) 65-85.
10. Sigmon, K., Matlab Primer. The MATH WORKS Inc., 1994.
11. Vavasis, S.A., Gaussian Elimination with Pivoting is P-complete, SIAM J. Disc. Math. 2 (1989) 413-423.