Parallelizing the QR algorithm for the unsymmetric algebraic eigenvalue problem: Myths and reality

SIAM Journal on Scientific Computing

Volumn 17, Issue 4, 1996, Pages 870-883

  Henry, Greg ^a   Van De Geijn, Robert ^b  

^a INTEL CORPORATION   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Eigenvalue; Parallel computing; QR algorithm; Schur decomposition

Indexed keywords

EID: 0001722652     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/0917056     Document Type: Article

References (36)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. SORENSON, LAPACK Users' Guide. Society for Industrial and Applied Mathematics. Philadelphia, PA, 1992.
2. L. AUSLANDER AND A. TSAO, On parallelizable eigensolvers, Advanced Appl. Math., 13 (1992), pp. 253-261.
3. Z. BAI AND J. DEMMEL, On a block implementation of Hessenberg multishift QR iteration, Internat. J. High Speed Computing. 1 (1989), pp. 97-112.
4. _, Design of a parallel nonsymmetric eigenroutine toolbox, part I, in Parallel Processing for Scientific Computing, R. Sincovec, D. Keyes, M. Leuze, L. Petzold, and D. Reed, eds., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1993, pp. 391-398.
5. Z. BAI, J. DEMMEL, J. DONGARRA, A. PETITET, H. ROBINSON, AND K. STANLEY, The Spectral Decomposition of Nonsymmetric Matrices on Distributed Memory Parallel Computers, LAPACK Working Note 91, University of Tennessee, Knoxville, Jan. 1995.
6. M. W. BERRY, J. J. DONGARRA, AND Y. KIM, A Highly Parallel Algorithm for the Reduction of a Nonsymmetric Matrix to Block Upper-Hessenberg Form, LAPACK Working Note 68, CS-94-221, University of Tennessee, Knoxville, Feb. 1994.
7. R. BYERS, Numerical stability and instability in matrix sign function based algorithms, in Computational and Combinatorial Methods in Systems Theory, C. Byrnes and A. Lindquist, eds., North-Holland, Amsterdam, 1986, pp. 185-200.
8. D. BOLEY, Solving the generalized eigenvalue problem on a synchronous linear processor array, Parallel Comput., 3 (1986), pp. 123-166.
9. D. BOLEY AND R. MAIER, A Parallel QR Algorithm for the Nonsymmetric Eigenvalue Problem, Technical Report TR-88-12, Dept. of Computer Science, University of Minneapolis, Minneapolis, 1988.
10. J. W. DEMMEL, LAPACK Working Note 47: Open Problems in Numerical Linear Algebra, Technical Report CS-92-164, University of Tennessee, May 1992.
11. J. J. DONGARRA AND M. SIDANI, A parallel algorithm for the nonsymmetric eigenvalue problem, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 542-569.
12. J. J. DONGARRA AND R. A. VAN DE GEIJN, Reduction to condensed form on distributed memory architectures, Parallel Comput., 18 (1992), pp. 973-982.
13. J. J. DONGARRA, R. A. VAN DE GEIJN, AND D. WALKER, Scalability issues affecting the design of a dense linear algebra library, J. Parallel Distributed Comput., 22 (1994), pp. 523-537.
14. P. J. EBERLEIN, On the Schur decomposition of a matrix for parallel computation, IEEE Trans. Comput., C-36 (1987), pp. 167-174.
15. J. G. F. FRANCIS, The QR transformation: A unitary analogue to the LR transformation, Parts I and II, Comp. J., 4 (1961), pp. 332-345.
16. G. A. GEIST AND G. J. DAVIS, Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed memory multiprocessor, Parallel Comput., 13 (1990), pp. 199-209.
17. G. A. GEIST, R. C. WARD, G. J. DAVIS, AND R. E. FUNDERLIC, Finding eigenvalues and eigenvectors of unsymmetric matrices using a hypercube multiprocessor, in Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, Pasadena, CA, G. Fox, ed., 1988, pp. 1577-1582.
18. G. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The John Hopkins University Press, Baltimore, MD, 1989.
19. B. A. HENDRICKSON AND D. E. WOMBLE, The torus-wrap mapping for dense matrix calculations on massively parallel computers., SIAM J. Sci. Statist. Comput., 15 (1994), pp. 1201-1226.
20. G. HENRY, Improving the unsymmetric parallel QR algorithm on vector machines, in Proc. of the 6th Conference of Parallel Processing, R. Sincovec et al., eds., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1993, pp. 353-357,
21. _, Increasing Data Reuse in the Unsymmetric QR Algorithm, Technical Report CTC92TR100, Theory Center, Cornell University, Ithaca, NY, July 1992.
22. _, A New Approach to the Schur Decomposition, Technical Report, Theory Center, Cornell University, Ithaca, NY, manuscript.
23. _, Improving Data Re-Use in Eigenvalue-Related Computations, Ph.D. thesis, Cornell University, Ithaca, NY, Jan. 1994.
24. I. C. F. IPSEN AND Y. SAAD, The impact of parallel architectures on the solution of eigenvalue problems, in Large Scale Eigenvalue Problems, J. Cullum and R. Willoughby, eds., Elsevier-North Holland, Amsterdam, 1986, pp. 37-49.
25. I. C. F. IPSEN, Y. SAAD, AND M. H. SCHULTZ, Complexity of dense-linear-system solution on a multiprocessor ring, Linear Algebra Appl., 77 (1986), pp. 205-239.
26. J. W. JUSZCZAK AND R. A. VAN DE GEUN, An experiment in coding portable parallel matrix algorithms, in Proceedings of the Fourth Conference on Hypercube Concurrent Computers and Applications, Monterey, CA, 1989, pp. 675-680.
27. S. LEDERMAN, A. TSAO, AND T. TURNBULL, A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues, Technical Report TR-91-042, Supercomputing Research Center, 1991.
28. C. B. MOLER, MATLAB User's Guide, Technical Report CS81-1, Department of Computer Science, University of New Mexico, Albuquerque, 1980.
29. A. PURKAYASTHA, A Parallel Algorithm for the Sylvester-Observer Equations, Ph.D. dissertation, Northern Illinois University, DeKalb, IL, Jan. 1993.
30. G. W. STEWART, A parallel implementation of the QR algorithm, Parallel Computing, 5 (1987), pp. 187-196.
31. R. A. VAN DE GEIJN, Implementing the QR-Algorithm on an Array of Processors, Ph.D. thesis, TR-1897, Department of Computer Science, University of Maryland, College Park, MD, 1987.
32. _, Storage schemes for parallel eigenvalue algorithms, in Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, G. Golub and P. Van Dooren, eds., Springer-Verlag, Berlin, New York, 1988, pp. 639-648.
33. R. A. VAN DE GEIJN AND D. G. HUDSON, An efficient parallel implementation of the nonsymmetric QR algorithm, in Proceedings of the 4th Conference on Hypercube Concurrent Computers and Applications, Monterey, CA, 1989, pp. 697-700.
34. D. WATKINS, Shifting strategies for the parallel QR algorithm, SIAM J. Sci. Comput., 15 (1994), pp. 953-958.
35. _, Transmission of shifts in the multishift QR algorithm, Proceedings of the 5th SIAM Conference on Applied Linear Algebra, Snowbird, UT, June 1994, pp. 302-305.
36. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, 1965.