An efficient method for computing eigenvalues of a real normal matrix

Journal of Parallel and Distributed Computing

Volumn 63, Issue 6, 2003, Pages 638-648

  Zhou, B B ^a   Brent, R P ^b  

^a DEAKIN UNIVERSITY   (Australia)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Eigenvalue decomposition; Jacobi algorithm and QR algorithm; Normal matrix; Parallel computing

Indexed keywords

EID: 0037707112     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(03)00007-8     Document Type: Article

References (28)

1. C.H. Bischof, The two-sided block, Jacobi method on a hypercube, in: M.T. Heath (Ed.), Hypercube Multi-processors, SIAM, Philadelphia, PA, 1988, pp. 612-618.
2. R.P. Brent, Parallel algorithms for digital signal processing, Proceedings of NATO Advanced Study Institute on Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, Leuven, Belgium, August, 1988.
3. R.P. Brent, F.T. Luk, The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays, SIAM J. Sci. Statist. Comput. 6 (1985) 69-84.
4. J. Demmel, K. Veselić, Jacobi's method is more accurate than QR, SIAM J. Sci. Statist. Comput. 11 (1992) 1204-1246.
5. P.J. Eberlein, On the Schur decomposition of a matrix for parallel computation, IEEE Trans. Comput. C-36 (2) (1987) 167-174.
6. P.J. Eberlein, H. Park, Efficient implementation of Jacobi algorithms and Jacobi sets on distributed memory architectures, J. Partial. Distrib. Comput. 8 (1990) 358-366.
7. L.M. Ewerbring, F.T. Luk, Computing the singular value decomposition on the Connection Machine, IEEE Trans. Comput. 39 (1990) 152-155.
8. G. Forsythe, P. Henrici, The cyclic Jacobi method for computing the principal values of a complex matrix, Trans. Amer. Math. Soc. 94 (1960) 1-23.
9. G.R. Gao, S.J. Thomas, An optimal parallel Jacobi-like solution method for the singular value decomposition, in: Proceedings of the International Conference on Parallel Processing, St. Charles, Illinois, 1988, pp. 47-53.
10. D. Gimenez, V. Hernandez, R. van de Geijn, A.M. Vidal, A Jacobi method by blocks on a mesh of processors, Concurrency: Prac. Experience 9 (5) (1997) 391-411.
11. G.H. Golub, C.F. Van Loan, Matrix Computations, 3rd Edition, The Johns Hopkins University Press, Baltimore, MD, 1996.
12. K. Hüper, U. Helmke, Structure and convergence of Jacobi-type methods, Technical Report, TUM-LNS-TR-95-02, Institute of Network Theory and Circuit Design, Technical University of Munich, Germany, 1995.
13. T.J. Lee, F.T. Luk, D.L. Boley, Computing the SVD on a fat-tree architecture, Report 92-33, Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York, November 1992.
14. F.T. Luk, Computing the singular-value decomposition on the ILLIAC IV, ACM Trans. Math. Software 6 (1980) 524-539.
15. F.T. Luk, A triangular processor array for computing singular values, Linear Algebra Appl. 77 (1986) 259-273.
16. F.T. Luk, H. Park, On parallel Jacobi orderings, SIAM J. Sci. Statist. Comput. 10 (1989) 18-26.
17. N. Mackey, Hamilton and Jacobi meet again: quaternions and the eigenvalue problem, SIAM J. Matrix Anal. Appl. 16 (2) (1995) 421-435.
18. M. Mantharam, P.J. Eberlein, The real two-zero algorithm: a parallel algorithm to reduce a real matrix to a real Schur form, IEEE Trans. Parallel Distrib. Systems 6 (1) (1995) 48-62.
19. W.F. Mascarenhas, On the convergence of the Jacobi method for arbitrary orderings, SIAM J. Matrix Anal. Appl. 16 (4) (1995) 1197-1209.
20. P.P.M. De Rijk, A one-sided Jacobi algorithm for computing the singular value decomposition on a vector computer, SIAM J. Sci. Statist. Comput. 10 (1989) 359-371.
21. B.T. Smith, J.M. Boyle, J.J. Dongarra, B.S. Garbow, Y. Ikebe, V.C. Klema, C.B. Moler, Matrix Eigensystem Routines - EISPACK Guide, 2nd Edition, Lecture Notes in Computer Science, Vol. 6, Springer, Berlin, 1976.
22. R. Schreiber, Solving eigenvalue and singular value problems on an undersized systolic array, SIAM. J. Sci. Statist. Comput. 7 (1986) 441-451.
23. G.W. Stewart, A Jacobi-like algorithm for computing the Schur decomposition of a non-Hermitian matrix, SIAM J. Sci. Statist. Comput. 6 (4) (1985) 853-864.
24. R. Suda, A. Nishida, Y. Oyanagi, A high performance parallelization scheme for Hessenberg double shift QR algorithm, Parallel Comput. 25 (6) (1999) 729-744.
25. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, England, 1965.
26. B.B. Zhou, R.P. Brent, A parallel ordering algorithm for efficient one-sided Jacobi SVD computations, J. Parallel Distrib. Comput. 42 (1997) 1-10.
27. B.B. Zhou, R.P. Brent, On the parallel implementation of the one-sided Jacobi algorithm for singular value decompositions, Proceedings of 3rd Euromicro Workshop on Parallel and Distributed Processing, San Remo, Italy, January 1995, pp. 401-408.
28. B.B. Zhou, R.P. Brent, Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix using real arithmetic, Proceedings of the 10th International Parallel Processing Symposium, Honolulu, Hawaii, April, 1996, pp. 593-600.