The design and implementation of the MRRR algorithm

ACM Transactions on Mathematical Software

Volumn 32, Issue 4, 2006, Pages 533-560

  Dhillon, Inderjit S ^a,c   Parlett, Beresford N ^b,d   Vömel, Christof ^b,d  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of Texas at Austin   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Design; Eigenvalues; Eigenvectors; Implementation; LAPACK; Multiple relatively robust representations; Numerical software; Symmetric matrix

Indexed keywords

NUMERICAL SOFTWARE; SYMMETRIC MATRIX;

COMPUTER SOFTWARE; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; OPTIMIZATION;

ALGORITHMS;

EID: 33845548230     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1186785.1186788     Document Type: Article

References (42)

1. ANDERSON, E., BAI, Z., BISCHOF, C., BLACKFORD, S., DEMMEL, J., DONGARRA, J., CROZ, J. D., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSEN, D. 1999. LAPACK User's Guide, 3rd. ed. SIAM, Philadelphia, PA.
2. ANSI/IEEE 1985. IEEE Standard for Binary Floating Point Arithmetic. Std 754-1985 ed. ANSI/IEEE, New York.
3. ANTONELLI, D. AND VÖMEL, C. 2005. LAPACK working note 168: PDSYEVR. ScaLAPACK's parallel MRRR algorithm for the symmetric eigenvalue problem. Tech. Rep. UCBCSD-05-1399, University of California, Berkeley.
4. BARLOW, J. AND DEMMEL, J. 1990. Computing accurate eigensystems of scaled diagonally dominant matrices. SIAM J. Numer. Anal. 27, 3, 762-791.
5. BIENTINESI, P., DHILLON, I. S., AND VAN DE GEIJN, R. A. 2005. A parallel eigensolver for dense symmetric matrices based on multiple relatively robust representations. SIAM J. Sci. Comput. 27, 1, 43-66.
6. BLACKFORD, L. S., DEMMEL, J., DONGARRA, J. J., DUFF, I. S., HAMMARLING, S., HENRY, G., HEROUX, M., KAUFMAN, L., LUMSDAINE, A., PETITET, A., POZO, R., REMINGTON, K., AND WHALEY, R. C. 2002. An updated set of basic linear algebra subprograms (BLAS). ACM Trans. Math. Softw. 28, 2, 135-151.
7. BUNCH, J., NIELSEN, P., AND SORENSEN, D. 1978. Rank-One modification of the symmetric eigen-problem. Numer. Math. 31, 31-48.
8. CHOI, J., DEMMEL, J., DHILLON, I., DONGARRA, J., OSTHOUCHOV, S., PETITET, A., STANLEY, K., WALKER, D., AND WHALEY, R. C. 1996. ScaLAPACK: A portable linear algebra library for distributed memory computers - Design issues and performance. Comput. Phys. Commun. 97, 1-15.
9. CHOI, J., DONGARRA, J. J., OSTROUCHOV, S., PETITET, A., AND WALKER, D. 1995. A proposal for a set of parallel basic linear algebra subprograms. Tech. Rep. UT-CS-95-292, University of Tennessee, Knoxville, TN.
10. CUPPEN, J. J. M. 1981. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36, 177-195.
11. DAVIS, C. AND KAHAN, W. 1970. The rotation of eigenvectors by a perturbation. III. SIAM J. Numer. Anal. 7, 1, 1-47.
12. DEMMEL, J. W. 1997. Applied Numerical Linear Algebra. SIAM, Philadelphia, PA.
13. DEMMEL, J. W., DHILLON, I. S., MARQUES, O. A., PARLETT, B. N., AND VÖMEL, C. 2005. Performance and accuracy of the symmetric eigensolvers in LAPACK. University of California, Berkeley. In preparation.
14. DEMMEL, J. W., DHILLON, I. S., AND REN, H. 1995. On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic. Electron. Trans. Num. Anal. 3, 116-140.
15. DEMMEL, J. W. AND KAHAN, W. 1990. Accurate singular values of bidiagonal matrices. SIAM J. Sci. Stat. Comput. 11, 5, 873-912.
16. DEMMEL, J. W. AND LI, X. S. 1994. Faster numerical algorithms via exception handling. IEEE Trans. Comp. 48, 8, 983-992.
17. 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem. Ph.D. thesis, University of California, Berkeley, California, USA.
18. DHILLON, I. S. AND PARLETT, B. N. 2004b. Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices. Linear Algebra Appl. 387, 1-28.
19. DHILLON, I. S. AND PARLETT, B. N. 2004b. Orthogonal eigenvectors and relative gaps. SIAM J. Matrix Anal. Appl. 25, 3, 858-899.
20. DHILLON, I. S., PARLETT, B. N., AND VÖMEL, C. 2005. Glued matrices and the MRRR algorithm. SIAM J. Sci. Comput. 27, 2, 496-510.
21. DONGARRA, J. AND WHALEY, R. C. 1995. A User's Guide to the BLACS v1.1. Tech. Rep. UT-CS-95-281, University of Tennessee, Knoxville, TN, USA.
22. DONGARRA, J. J., DU CROZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1-17.
23. DONGARRA, J. J., DUFF, I. S., SORENSEN, D. C., AND VAN DER VORST, H. A. 1998. Numerical Linear Algebra for High-Performance Computers. SIAM Press, Philadelphia, PA.
24. DONGARRA, J. J. AND VAN DE GEIJN, R. A. 1991. Lapack working note 37: Two dimensional basic linear algebra communication subprograms. Tech. Rep. UT-CS-91-138, University of Tennessee, Knoxville, TN, USA.
25. FERNANDO, K. V. AND PARLETT, B. N. 1994. Accurate singular values and differential qd algorithms. Numeri. Math. 67, 191-229.
26. GU, M. AND EISENSTAT, S. C. 1995. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16, 1, 172-191.
27. IPSEN, I. C. F. 1997. Computing an eigenvector with inverse iteration. SIAM Rev. 39, 2, 254-291.
28. MARQUES, O. A., PARLETT, B. N., AND VÖMEL, C. 2005. LAPACK working note 167: Subset computations with the MRRR algorithm. Tech. Rep. UCBCSD-05-1392, University of California, Berkeley, Calfornia, USA.
29. MARQUES, O. A., RIEDY, E. J., AND VÖMEL, C. 2005. Lapack working note 172: Benefits of IEEE-754 features in modern symmetric tridiagonal eigensolvers. Tech. Rep. UCBCSD-05-1414, University of California, Berkeley, California, USA.
30. OVERTON, M. 2001. Numerical Computing with IEEE Floating Point Arithmetic. SIAM Press, Philadelphia, PA.
31. PARLETT, B. N. 1995. Acta Numerica. Cambridge University Press, Cambridge, UK. 459-491.
32. PARLETT, B. N. 1998. The Symmetric Eigenvalue Problem. SIAM Press, Philadelphia, PA.
33. t. J. Comp. Appl. Math. 123, 117-130.
34. PARLETT, B. N. 2003. Perturbation of eigenpairs of factored symmetric tridiagonal matrices. Found. Comput. Math. 3, 2, 207-223.
35. PARLETT, B. N. 2005. A bidiagonal matrix determines its hyperbolic SVD to varied relative accuracy. SIAM J. Matrix Anal. Appl. 26, 4, 1022-1057.
36. PARLETT, B. N. AND DHILLON, I. S. 1997. Fernando's solution to Wilkinson's problem: An application of double factorization. Linear Algebra Appl. 267, 247-279.
37. PARLETT, B. N. AND DHILLON, I. S. 2000a. Relatively robust representations of symmetric tridiagonals. Linear Algebra Appl. 309, 1-3, 121-151.
38. PARLETT, B. N. AND MARQUES, O. 2000. An implementation of the dqds algorithm (positive case). Linear Algebra and Appl. 309, 217-259.
39. RUTISHAUSER, H. 1954. Der quotienten-differenzen-algorithmus. Z. Angew. Math. Phys. 5, 233-251.
40. RUTISHAUSER, H. 1976. Vorlesungen über Numerische Mathematik. Birkhäuser, Basel.
41. SNIR, M., OTTO, S., HUSS-LEDERMAN, S., WALKER, D., AND DONGARRA, J. J. 1996. MPI: The Complete Reference. MIT Press, Cambridge, MA.
42. VAN DE GEIJN, R. A. 1997. Using PLAPACK: Parallel Linear Algebra Package. MIT Press, Cambridge, MA.