A framework for the MR3 algorithm: Theory and implementation

SIAM Journal on Scientific Computing

Volumn 35, Issue 2, 2013, Pages

  Willems, Paul R ^a   Lang, Bruno ^a  

^a UNIVERSITY OF WUPPERTAL   (Germany)

Author keywords

Eigensystem; MRRR algorithm; Symmetric tridiagonal matrix; Theory and implementation

Indexed keywords

COMPUTATION THEORY; LINEAR TRANSFORMATIONS;

CORE ALGORITHMS; EIGENPAIRS; EIGENSYSTEM; MATRIX; MODULARS; MRRR ALGORITHM; RECURSIONS; RECURSIVE CORES; SYMMETRIC TRIDIAGONAL MATRIX; THEORY AND IMPLEMENTATION;

MATRIX ALGEBRA;

EID: 84880609263     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/110834020     Document Type: Article

References (39)

1. E. ANDERSON, Z. BAI, C. BISCHOF, S. BLACKFORD, J. DE MMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. SORENSEN, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, 1999.
2. P. BIENTINESI, I. S. DHILLON, AND R. A. VAN DE GEIJN, A parallel eigensolver for dense symmetric matrices based on multiple relatively robust representations, SIAM J. Sci. Comput., 27(2005), pp. 43-66.
3. J. J. M. CUPPEN, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numer. Math., 36(1981), pp. 177-195.
4. J. W. DEMMEL, Applied Numerical Linear Algebra, SIAM, Philadelphia, 1997.
5. J. W. DEMMEL AND W. KAHAN, Accurate singular values of bidiagonal matrices, SIAM J. Sci. Comput., 11(1990), pp. 873-912.
6. J. W. DEMMEL, O. A. MARQUES, B. N. PARLETT, AND C. VÖMEL, Performance and accuracy of LAPACK's symmetric tridiagonal eigensolvers, SIAM J. Sci. Comput., 30(2008), pp. 1508-1526.
7. 2) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem, Ph. D. thesis, University of California, Berkeley, Berkeley, CA, 1997.
8. I. S. DHILLON AND B. N. PARLETT, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Linear Algebra Appl., 387(2004), pp. 1-28.
9. I. S. DHILLON AND B. N. PARLETT, Orthogonal eigenvectors and relative gaps, SIAM J. Matrix Anal. Appl., 25(2004), pp. 858-899.
10. I. S. DHILLON, B. N. PARLETT, AND C. VÖMEL, Glued matrices and the MRRR algorithm, SIAM J. Sci. Comput., 27(2005), pp. 496-510.
11. I. S. DHILLON, B. N. PARLETT, AND C. VÖMEL, The design and implementation of the MRRR algorithm, ACM Trans. Math. Software, 32(2006), pp. 533-560.
12. K. V. FERNANDO, On computing an eigenvector of a tridiagonal matrix. Part I: Basic results, SIAM J. Matrix Anal. Appl., 18(1997), pp. 1013-1034.
13. K. V. FERNANDO AND B. N. PARLETT, Accurate singular values and differential qd algorithms, Numer. Math., 67(1994), pp. 191-229.
14. J. FRANCIS, The QR transformation: A unitary analogue to the LR transformation. I., Comput. J., 4(1961/1962), pp. 265-271.
15. J. FRANCIS, The QR transformation. II., Comput. J., 4(1961/1962), pp. 332-345.
16. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
17. 2) Algorithmus für die bidiagonale Singulärwertzerlegung, Ph. D. thesis, Bergische Universität Gesamthochschule Wuppertal, Fachbereich Mathematik, Wuppertal, Germany, 2001.
18. M. GU AND S. C. EISENSTAT, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM J. Matrix Anal. Appl., 16(1995), pp. 172-191.
19. I. C. F. IPSEN, Computing an eigenvector with inverse iteration, SIAM Rev., 39(1997), pp. 254-291.
20. W. KAHAN, Accurate Eigenvalues of a Symmetric Tri-diagonal Matrix, Technical Report CS41, Computer Science Department, Stanford University, Stanford, CA, 1966.
21. B. LANG, Using level 3 BLAS in rotation-based algorithms, SIAM J. Sci. Comput., 19(1998), pp. 626-634.
22. O. A. MARQUES, B. N. PARLETT, AND C. VÖMEL, Computations of eigenpair subsets with the MRRR algorithm, Numer. Linear Algebra Appl., 13(2006), pp. 643-653.
23. O. A. MARQUES, C. VÖMEL, J. W. DEMMEL, AND B. N. PARLETT, Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers, ACM Trans. Math. Software, 35(2008), pp. 8:1-8:13.
24. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
25. B. N. PARLETT, Invariant subspaces for tightly clustered eigenvalues of tridiagonals, BIT, 36(1996), pp. 542-562.
26. B. N. PARLETT, Spectral sensitivity of products of bidiagonals, Linear Algebra Appl., 275/276(1998), pp. 417-431.
27. B. N. PARLETT, Perturbation of eigenpairs of factored symmetric tridiagonal matrices, Found. Comput. Math., 3(2003), pp. 207-223.
28. B. N. PARLETT, A bidiagonal matrix determines its hyperbolic SVD to varied relative accuracy, SIAM J. Matrix Anal. Appl., 26(2005), pp. 1022-1057.
29. B. N. PARLETT AND I. S. DHILLON, Fernando's solution to Wilkinson's problem: An application of double factorization, Linear Algebra Appl., 267(1997), pp. 247-279.
30. B. N. PARLETT AND I. S. DHILLON, Relatively robust representations of symmetric tridiagonals, Linear Algebra Appl., 309(2000), pp. 121-151.
31. B. N. PARLETT AND O. A. MARQUES, An implementation of the dqds algorithm (positive case), Linear Algebra Appl., 309(2000), pp. 217-259.
32. B. N. PARLETT AND C. VÖMEL, The spectrum of a glued matrix, SIAM J. Matrix Anal. Appl., 31(2009), pp. 114-132.
33. F. G. VAN ZEE, R. A. VAN DE GEIJN, AND G. QUINTANA-ORTÍ, Restructuring the QR Algorithm for High-Performance Application of Givens Rotations, FLAME Working Note 60, Technical Report TR-11-36, University of Texas at Austin, Austin, TX, 2011.
34. C. VÖMEL, ScaLAPACK's MRRR algorithm, ACM Trans. Math. Software, 37(2009), 1.
35. C. VÖMEL AND B. N. PARLETT, Detecting localization in an invariant subspace, SIAM J. Sci. Comput. 33(2011), pp. 3447-3467.
36. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, UK, 1965.
37. 3-type Algorithms for the Tridiagonal Symmetric Eigenproblem and the Bidiagonal SVD, Ph. D. thesis, Bergische Universität Wuppertal, Fachbereich Mathematik und Naturwissenschaften, Wuppertal, Germany, 2010.
38. 3 algorithm, Electron. Trans. Numer. Anal., 38(2011), pp. 363-400.
39. 3 algorithm-new representations and analysis, SIAM J. Matrix Anal. Appl., 33(2012), pp. 523-553.