An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems

Numerische Mathematik

Volumn 76, Issue 3, 1997, Pages 279-308

  Bai, Zhaojun ^a   Demmel, James ^b   Gu, Ming ^c  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031525908     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002110050264     Document Type: Article

References (52)

1. Ahlfors, L. (1966): Complex Analysis. McGraw-Hill
2. Ammar, G., Benner, P., Mehrmann, V. (1993): A multishift algorithm for the numerical solution of algebraic Riccati equations. Elect. Trans. on Numer. Anal., 1:33-48
3. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Ostrouchov, S., Sorensen, D. (1995): LAPACK Users' Guide (second edition). SIAM, Philadelphia 324 pages
4. Anderson, E., Bai, Z., Dongarra, J. (1992): Generalized QR factorization and its applictions. Lin. Alg. Appl., 162-164:243-271
5. Arnold, W.F., Laub., A.J. (1984): Generalized eigenproblem algorithms and software for algebraic Riccati equations. Proc. IEEE, 72:1746-1754
6. Auslander, L., Tsao, A. (1992): On parallelizable eigensolvers. Advances in Applied Mathematics, 13:253-261
7. Bai, Z., Demmel, J. (1993): Design of a parallel nonsymmetric eigenroutine toolbox, Part I. In: Proceedings of the Sixth SIAM Conference on Parallel Proceesing for Scientific Computing. SIAM. Long version available as UC Berkeley Computer Science report all.ps.Z via anonymous ftp from tr-ftp.cs.berkeley.edu, directory pub/tech-reports/csd/csd-92-718
8. Bai, Z., Demmel, J. (1993): On swapping diagonal blocks in real Schur form. Lin. Alg. Appl., 186:73-96
9. Bai, Z., Demmel, J., Dongarra, J., Petitet, A., Robinson, H. (1995): The spectral decomposition of nonsymmetric matrices on distributed memory parallel computers. Compute Science Dept. Technical Report CS-95-273, University of Tennessee at Knoxville to appear in SIAM J. Sci. Comp.
10. Bai, Z., Demmel, J., Gu, M. (1994): Inverse free parallel spectral divide and conquer algorithms for nonsymmetric eigenproblems. Computer Science Division Report UCB//CSD-94-793, UC Berkeley, February 1994. available by anonymous ftp to tr-ftp.cs.berkeley.edu in directory pub/tech-reports/csd/csd-94-79
11. Batterson, S. (1990): Convergence of the shifted QR algorithm on 3 by 3 normal matrices. Num. Math., 58:341-352
12. Bischof, C., Huss-Lederman, S., Sun, X., Tsao, A. (1993): The PRISM project: Infrastructure and algorithms for parallel eigensolvers. In Proceedings of the Scalable Parallel Libraries Conference, Mississippi State, Mississippi. IEEE Computer Society
13. Bojanczyk, A., Van Dooren, P. (1993): personal communication
14. ∞-norm. Systems Control Letters, 15:1-7
15. ∞ norm of a transfer matrix and related problems. Mathematics of Control, Signals, and Systems, 2(3):207-219
16. Bulgakov, A.Ya., Godunov, S.K. (1988): Circular dichotomy of the spectrum of a matrix. Siberian Math. J., 29(5):734-744
17. Buzbee, B., Golub, G., Nielsen, C. (1970): On direct methods for solving Poisson's equation. SIAM J. Num. Anal., 7:627-656
18. Byers, R. (1987): Solving the algebraic Riccati equation with the matrix sign function. Lin. Alg. Appl., 85:267-279
19. Byers, R. (1988): A bisection method for measuring the distance of a stable matrix to the unstable matrices. SIAM J. Sci. Stat. Comp., 9(5):875-881
20. Chan, T. (1987): Rank revealing QR factorizations. Lin. Alg. Appl., 88/89:67-82
21. Demmel, J. (1987): Three methods for refining estimates of invariant subspaces. Computing, 38:43-57
22. Demmel, J. (1993): Trading off parallelism and numerical stability. In G. Golub, M. Moonen, B. de Moor, editors, Linear Algebra for Large Scale and Real-Time Applications, pages 49-68. Kluwer Academic Publishers NATO-ASI Series E: Applied Sciences, Vol. 232; Available as all.ps.Z via anonymous ftp from tr-ftp.cs.berkeley.edu, in directory pub/tech-reports/csd/csd-92-702
23. Demmel, J., Heath, M., van der Vorst, H. (1993): Parallel numerical linear algebra. In Iserles A., editor, Acta Numerica, volume 2. Cambridge University Press
24. Demmel, J., Kågstro̊m, B. (1987) Computing stable eigendecompositions of matrix pencils. Lin. Alg. Appl., 88/89:139-186
25. Demmel, J., Li, X. (1994): Faster numerical algorithms via exception handling. IEEE Trans. Comp., 43(8):983-992. LAPACK Working Note 59
26. Dongarra, J., Du Croz, J., Duff, I., Hammarling, S. (1990): A set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Soft., 16(1): 1-17
27. Eberlein, P. (1987): On the Schur decomposition of a matrix for parallel computation. IEEE Trans. Comput. P., 36:167-174
28. Gantmacher, F. (1959): The Theory of Matrices, vol. II (transl.). Chelsea, New York
29. Gardiner, J., Laub, A. (1986): A generalization of the matrix-sign function solution for algebraic Riccati equations. Int. J. Control, 44:823-832
30. Godunov, S.K. (1986): Problem of the dichotomy of the spectrum of a matrix. Siberian Math. J., 27(5):649-660
31. Golub, G., Van Loan, C. (1989): Matrix Computations. Johns Hopkins University Press, Baltimore, MD, 2nd edition
32. Gu, M., Eisenstat, S. (1993): An efficient algorithm for computing a rank-revealing QR decomposition. Computer Science Dept. Report YALEU/DCS/RR-967, Yale University
33. Gu, M., Eisenstat, S.C. (1995): A divide-and-conquer algorithm for the bidiagonal SVD. SIAM J. Mat. Anal. Appl., 16(1):79-92
34. Henry, G., van de Geijn, R. (1994): Parallelizing the QR algorithm for the unsymmetric algebraic eigenvalue problem: myths and reality. Computer Science Dept. Technical Report CS-94-244, University of Tennessee, Knoxville. (LAPACK Working Note #79); to appear in SIAM SISC
35. Higham, N.J. (1986): Computing the polar decomposition - with applications. SIAM J. Sci. Stat. Comput., 7:1160-1174
36. Higham, N.J., Philip, A. (1995): Knight. Matrix powers in finite precision arithmetic. SIAM J. Mat. Anal. Appl., 16:343-358
37. Hong, P., Pan, C.T. (1992): The rank revealing QR and SVD. Math. Comp., 58:575-232
38. Howl, J. (1983): The sign matrix and the separation of matrix eigenvalues. Lin. Alg. Appl., 49:221-232
39. Kenney, C., Laub, A. (1991): Rational iteration methods for the matrix sign function. SIAM J. Mat. Anal. Appl., 21:487-494
40. Malyshev, A.N. (1989): Computing invariant subspaces of a regular linear pencil of matrices. Siberian Math. J., 30(4):559-567
41. Malyshev, A.N. (1992): Guaranteed accuracy in spectral problems of linear algebra, I,II. Siberian Adv. in Math., 2(1,2): 144-197, 153-204
42. Malyshev, A.N. (1993): Parallel algorithm for solving some spectral problems of linear algebra. Lin. Alg. Appl., 188,189:489-520
43. Paige, C. (1990): Some aspects of generalized QR factorization. In M. Cox and S. Hammarling, editors. Reliable Numerical Computations. Clarendon Press, Oxford
44. Parlett, B. (1980): The Symmetric Eigenvalue Problem. Prentice Hall, Englewood Cliffs, NJ
45. Roberts, J. (1980): Linear model reduction and solution of the algebraic Riccati equation. Inter. J. Control. 32:677-687
46. Sameh, A. (1971 ): On Jacobi and Jacobi-like algorithms for a parallel computer. Math. Comp., 25:579-590
47. Shroff, G. (1991): A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix. Num. Math., 58:779-805
48. Stewart, G.W. (1973): Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Review, 15(4):727-764
49. Stewart, G.W. (1985): A Jacobi-like algorithm for computing the Schur decomposition of a non-Hermitian matrix. SIAM J. Sci. Stat. Comput., 6:853-864
50. Stewart, G.W. (1993): Updating a rank-revealing ULV decomposition. SIAM J. Mat. Anal. Appl., 14(2):494-499
51. Stewart, G.W., Sun. J.-G. (1990): Matrix Perturbation Theory. Academic Press, New York
52. Trefethen, L.N. (1991): Pseudospectra of matrices. In 1991 Dundee Numerical Analysis Conference Proceedings, Dundee, Scotland