The spectral decomposition of nonsymmetric matrices on distributed memory parallel computers

SIAM Journal on Scientific Computing

Volumn 18, Issue 5, 1997, Pages 1446-1461

  Bai, Z ^a   Demmel, J ^b   Dongarra, J ^c,d   Petitet, A ^c   Robinson, H ^e   Stanley, K ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of Tennessee Knoxville   (United States)

^d OAK RIDGE NATIONAL LABORATORY   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Eigenvalue problem; Invariant subspaces; Nonsymmetric matrices; Parallelizable; ScaLAPACK; Spectral decomposition; Spectral divide and conquer

Indexed keywords

EIGENVALUE PROBLEM; NONSYMMETRIC MATRICES; SCALAPACK MATRIX INVERSION; SPECTRAL DECOMPOSITION;

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; GRAPHICAL USER INTERFACES; INVERSE PROBLEMS; ITERATIVE METHODS; MATRIX ALGEBRA;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031215987     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595281368     Document Type: Article

References (35)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. Du CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, 2nd edition, SIAM, Philadelphia, PA, 1995.
2. L. AUSLANDER AND A. TSAO, On parallelizable eigensolvers, Adv. in Appl. Math., 13 (1992), pp. 253-261.
3. Z. BAI AND J. DEMMEL, Design of a parallel nonsymmetric eigenroutine toolbox, Part I, in Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, R. F. Sincovec et al., ed., SIAM, Phiadelphia, PA, 1993.
4. Z. BAI, J. DEMMEL, AND M. Gu, Inverse free parallel spectral divide and conquer algorithms for nonsymmetric eigenproblems, Numer. Math., 76 (1997), pp. 279-308.
5. A. N. BEAVERS AND E. D. DENMAN, A computational method for eigenvalue and eigenvectors of a matrix with real eigenvalues, Numer. Math., 21 (1973), pp. 389-396.
6. C. BISCHOF AND X. SUN, A Divide and Conquer Method for Tridiagonalizing Symmetric Matrices with Repeated Eigenvalues, Tech. report, Argonne National Laboratory, Argonne, IL, 1996.
7. R. BYERS, Solving the algebraic Riccati equation with the matrix sign function, Linear Algebra Appl., 85 (1987), pp. 267-279.
8. R. BYERS, C. HE, AND V. MEHRMANN, The Matrix Sign Function Method and the Computation of Invariant Subspaces, Tech. report SPC 94-25, Fakultät für Mathematik, TU Chemnitz-Zwickau, Germany, 1994.
9. S. CHAKRABARTI, J. DEMMEL, AND K. YELICK, On the Benefit of Mixed Parallelism, Tech. report, Computer Science Division, University of California, Berkeley, CA, 1994; submitted to IPPS.
10. T. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
11. J. CHOI, J. DEMMEL, I. DHILLON, J. DONGARRA, S. OSTROUCHOV, A. PETITET, K. STANLEY, D. WALKER, AND R. WHALEY, ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers - Design Issues and Performance, Tech. report CS-95-283, Computer Science Deptartment, University of Tennessee, Knoxville, TN, 1995.
12. J. CHOI, J. DONGARRA, AND D. WALKER, PB-BLAS: A Set of Parallel Block Basic Linear Algebra Subprograms, Tech. report, University of Tennessee, Knoxville, TN, 1993.
13. J. CHOI, J. DONGARRA, AND D. WALKER, PUMMA: Parallel Universal Matrix Multiplication Algorithms on Distributed Memory Concurrent Computers, Tech. report CS-93-187, Computer Science Department, University of Tennessee, Knoxville, TN, 1993.
14. T. COLEMAN AND P. PLASSMANN, A parallel nonlinear least-squares solver: Theoretical analysis and numerical results, SIAM J. Sci. Comput., 13 (1992), pp. 771-793.
15. J. DEMMEL, Trading off parallelism and numerical stability, in Linear Algebra for Large Scale and Real-Time Applications, G. Golub, M. Moonen, and B. de Moor, ed., Kluwer Academic Publishers, Norwell, MA, 1993, pp. 49-68.
16. J. DEMMEL, M. HEATH, AND H. VAN DER VORST, Parallel numerical linear algebra, in Acta Numerica, Vol. 2, A. Iseries, ed., Cambridge University Press, London, 1993.
17. J. DONGARRA, Performance of Various Computers Using Standard Linear Equations Software, Tech. report, Computer Science Department, University of Tennessee, Knoxville, TN, 1993.
18. J. DONGARRA AND M. SIDANI, A parallel algorithm for the non-symmetric eigenvalue problem, SIAM J. Sci. Comput., 14 (1993), pp. 542-569.
19. J. DONGARRA, R. VAN DE GCEIJN, AND R. WHALEY, A Users' Guide to the BLACS, Tech. report, University of Tennessee, Knoxville, TN, 1993.
20. M. Gu AND S. EISENSTAT, An Efficient Algorithm for Computing a Rank-Revealing QR Decomposition, Tech. report YALEU/DCS/RR-916, Computer Science Department, Yale University, New Haven, CT, 1993.
21. G. HENRY AND R. VAN DE GEIJN, Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problems: Myths and Reality, Tech. report CS-TR-94-244, University of Tennessee, Knoxville, TN, 1994.
22. N. J. HIGHAM, Computing the polar decomposition - with applications, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 1160-1174.
23. J. HOWLAND, The sign matrix and the separation of matrix eigenvalues, Linear Algebra Appl., 49 (1983), pp. 221-232.
24. S. HUSS-LEDERMAN, A. TSAO, AND G. ZHANG, A parallel implementation of the invariant subspace decomposition algorithm for dense symmetric matrices, in Proc. of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993.
25. C. KENNEY AND A. LAUB, Rational iteration methods for the matrix sign function, SIAM J. Math. Anal. Appl., 21 (1991), pp. 487-494.
26. T.-Y. LI AND Z. ZENG, Homotopy-determinant algorithm for solving nonsymmetric eigenvalue problems, Math. Comp., 59 (1992), pp. 483-502.
27. S. L. LILLEVIK, The Touchstone 30 Gigaflop DELTA prototype, in Sixth Distributed Memory Computing Conference Proceedings, IEEE Press, Piscataway, NJ, 1991.
28. C.-C. LIN AND E. ZMIJEWSKI, A Parallel Algorithm for Computing the Eigenvalues of an Unsymmetric Matrix on an SIMD Mesh of Processors, Tech. report TRCS 91-15, Department of Computer Science, University of California, Santa Barbara, CA, 1991.
29. A. LITTLEFIELD, Characterizing and tuning communication performance on the Touchstone DELTA and iPSC/860, in Proc. of the 1992 Intel User's Group Meeting, Dallas, TX, October 4-7, 1992.
30. A. N. MALYSHEV, Parallel algorithm for solving some spectral problems of linear algebra, Linear Algebra Appl., 188/189 (1993), pp. 489-520.
31. J. ROBERTS, Linear model reduction and solution of the algebraic Riccati equation, Internat. J. Control, 32 (1980), pp. 677-687.
32. G. SHROFF, A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix, Numer. Math., 58 (1991), pp. 779-805.
33. G. W. STEWART, A Jacobi-like algorithm for computing the Schur decomposition of a nonHermitian matrix, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 853-864.
34. THINKING MACHINE CORPORATION, Connection Machine CM-5 Technical Summary, Cambridge, MA, 1992.
35. R. WHALEY, Basic Linear Algebra Communication Subroutines: Analysis and Implementation Across Multiple Parallel Architecture, Tech. report CS-TR-94-234, University of Tennessee, Knoxville, TN, 1994.