Parallel complexity of numerically accurate linear system solvers

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2000-2058

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

^a UNIVERSITY OF PISA   (Italy)

^b CNR Consiglio Nazionale delle Ricerche   (Italy)

^c UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^d UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Inherently sequential algorithms; Matrix factorization; NC algorithms; Numerical stability; P complete problems; Parallel complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

INHERENTLY SEQUENTIAL ALGORITHMS; MATRIX FACTORIZATION;

MATRIX ALGEBRA;

EID: 0033323425     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539797327118     Document Type: Article

References (24)

1. E. ALLENDER, R. BEALS, AND M. OGIHARA, The complexity of matrix rank and feasible systems of linear equations, in Proc. 28th Annual IEEE Symp. on Theory of Computing (STOC), IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 161-167.
2. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. Du CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSON, Lapack Users' Guide, SIAM, Philadelphia, PA, 1992.
3. A. BORODIN, J. VON ZUR GATHEN, AND J. HOPCROFT, Fast parallel matrix and GCD computations, Inform, and Control, 52 (1982), pp. 241-256.
4. B. CoDENOTTi, M. LEONCINI, AND F. P. PREPARATA, On the role of arithmetic fast parallel matrix inversion, Algorithmica, submitted.
5. L. CSANKY, Fast parallel matrix inversion algorithms, SIAM J. Comput., 5 (1976), pp. 618-623.
6. [G] J. W. DEMMEL, Trading Off Parallelism and Numerical Stability, Lapack Working Note 53, Tech. report ut-cs-92-179, Univ. of Tennessee, Knoxville, TN, June 1992. Available online at http://www.cs.utk.edu/-library/1992.html
7. J. J. DONGARRA, J. R. BUNCH, C. B. MOLER, AND G. W. STEWART, UNPACK Users' Guide, SIAM, Philadelphia, PA, 1979.
8. W. EBERLY, Efficient parallel independent subsets and matrix factorizations, in Proc. 3rd IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 204-211.
9. J. VON ZUR. GATHE.V, Parallel linear algebra, in Synthesis of Parallel Algorithms, J. Reif, ed., Morgan-Kaufmann, San Mateo, CA, 1993, pp. 573-617.
10. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 199G.
11. R. GREENLAW, H. J. HOOVER, AND W. L. Ruzzo, Limits to Parallel Computation, Oxford University Press, New York, NY, 1995.
12. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes, Morgan-Kaufmann, San Mateo, CA, 1992.
13. M. LEONCINI, On the parallel complexity of Gaussian elimination with pivoting, J. Comput. System Sei., 53 (1996), pp. 380-394.
14. M. LEONCINI, G. MANZINI, AND L. MARGARA, Parallel complexity of Householder QR factorization, in Proc. European Symp. on Algorithms, Lecture Notes in Comput. Sei. 1136, Springer-Verlag, New York, 1996, pp. 290-301.
15. M. LEONCINI, G. MANZINI, AND L. MARGARA, On the parallel complexity of matrix factorization algorithms, in Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1997, pp. 63-71.
16. M. LEONCINI, G. MANZINI, AND L. MARGARA, Companion MATLAB® software to "Parallel Complexity of Numerically Accurate Linear System Solvers," available online at http://www.imc.pi.cnr.it/manzini/transducer/
17. Using Matlab 5.1, The Mathworks Inc., Natick, MA, 1997.
18. J. J. MODI AND M. R. B. CLARKE, An alternative Givens ordering, Numer. Math., 43 (1984), pp. 83-90.
19. V. PAN, Complexity of parallel matrix computations, Theoret. Comput. Sei., 54 (1987), pp. 6585.
20. F. P. PREPARATA AND M. I. SIIAMOS, Computational Geometry, Springer-Verlag, New York, NY, 1985.
21. J. H. REIF, O(log2n) time efficient parallel factorization of dense, sparse separable, and banded matrices, in Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1994, pp. 278-289.
22. A. H. SAMEH AND R. P. BRENT, Solving triangular systems on a parallel computer, SIAM J. Numer. Anal., 14 (1977), pp. 1101-1113.
23. A. H. SAMEH AND D. J. KUCK, On stable parallel linear system solvers, J. ACM, 25 (1978), pp. 81-91.
24. S. A. VAVASIS, Gaussian elimination with pivoting is P-complete, SIAM J. Discrete Math., 2 (1989), pp. 413-423.