Detecting localization in an invariant subspace

SIAM Journal on Scientific Computing

Volumn 33, Issue 6, 2011, Pages 3447-3467

  Vömel, Christof ^a   Parlett, Beresford N ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Eigenvector computation; Envelope; Hermitian eigenvalue problem; Invariant subspace; Inverse iteration; Isolated eigenvalue cluster; Local splitting; Localization; Symmetric tridiagonal matrix

Indexed keywords

INVERSE PROBLEMS; MATRIX ALGEBRA; VECTORS;

EIGENVALUE PROBLEM; EIGENVECTOR COMPUTATIONS; ENVELOPE; HERMITIAN EIGENVALUE PROBLEM; HERMITIANS; INVARIANT SUBSPACE; INVERSE ITERATION; ISOLATED EIGENVALUE; ISOLATED EIGENVALUE CLUSTER; LOCAL SPLITTING; LOCALISATION; SPLITTINGS; SYMMETRIC TRIDIAGONAL MATRIX;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84856544343     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/09077624X     Document Type: Article

References (36)

1. E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, 1999.
2. E. Apra et al., NWChem: A Computational Chemistry Package for Parallel Computers, Version 4.7, Technical report, Pacific Northwest National Laboratory, Richland, WA, 2005.
3. M. Benzi and G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning, BIT, 39 (1999), pp. 417-438.
4. J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley, ScaLAPACK: A portable linear algebra library for distributed memory computers-Design issues and performance, Comput. Phys. Comm., 97 (1996), pp. 1-15. (Pubitemid 126387751)
5. J. J. M. Cuppen, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numer. Math., 36 (1981), pp. 177-195.
6. J. W. Demmel, I. S. Dhillon, and H. Ren, On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic, Electron. Trans. Numer. Anal., 3 (1995), pp. 116-140.
7. 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.
8. 2) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem, Ph.D. thesis, University of California, Berkeley, CA, 1997.
9. I. S. Dhillon, G. Fann, and B. N. Parlett, Application of a new algorithm for the symmetric eigenproblem to computational quantum chemistry, in Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing (Minneapolis), SIAM, Philadelphia, 1997, CD-ROM.
10. 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.
11. I. S. Dhillon and B. N. Parlett, Orthogonal eigenvectors and relative gaps, SIAMJ.Matrix Anal. Appl., 25 (2004), pp. 858-899. (Pubitemid 38920236)
12. 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.
13. 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. (Pubitemid 44927143)
14. I. S. Duff, R. G. Grimes, and J. G. Lewis, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
15. I. S. Duff, R. G. Grimes, and J. G. Lewis, Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release I), Technical report RAL-TR-92-086, Atlas Centre, Rutherford Appleton Laboratory, Oxford, UK, 1992.
16. I. S. Duff, R. G. Grimes, and J. G. Lewis, The Rutherford-Boeing Sparse Matrix Collection, Technical report RAL-TR-97-031, Atlas Centre, Rutherford Appleton Laboratory, Oxford, UK, 1997.
17. U. Elsner, V. Mehrmann, F. Milde, R. A. Römer, and M. Schreiber, The Anderson model of localization: A challenge for modern eigenvalue methods, SIAM J. Sci. Comput., 20 (1999), pp. 2089-2102.
18. S. Goedecker, Linear scaling electronic structure methods, Rev. Modern Phys., 71 (1999), pp. 1085-1123. (Pubitemid 129336905)
19. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
20. I. C. F. Ipsen, A history of inverse iteration, in Helmut Wielandt, Mathematical Works, Volume II: Matrix Theory and Analysis, B. Huppert and H. Schneider, eds., Walter de Gruyter, Berlin, 1996, pp. 464-472.
21. I. C. F. Ipsen, Computing an eigenvector with inverse iteration, SIAM Rev., 39 (1997), pp. 254-291. (Pubitemid 127654706)
22. R. A. Kendall et al., High performance computational chemistry: An overview of NWChem a distributed parallel application, Comput. Phys. Comm., 128 (2000), pp. 260-283.
23. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Research Nat. Bur. Standards, 45 (1950), pp. 255-282.
24. 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. (Pubitemid 44497181)
25. 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 (2009), 8.
26. B. N. Parlett, Invariant subspaces for tightly clustered eigenvalues of tridiagonals, BIT, 36 (1996), pp. 542-562. (Pubitemid 126419087)
27. B. N. Parlett, The Construction of Orthogonal Eigenvectors for Tight Clusters by Use of Submatrices, Technical report CPAM-664, Center for Pure and Applied Mathematics, University of California, Berkeley, Berkeley, CA, 1996.
28. B. N. Parlett, The Symmetric Eigenvalue Problem, Classics Appl. Math. 20, SIAM, Philadelphia, 1998.
29. B. N. Parlett, A result complementary to Gersgorin's circle theorem, Linear Algebra Appl., 431 (2009), pp. 20-27.
30. 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. (Pubitemid 127380729)
31. B. N. Parlett and I. S. Dhillon, Relatively robust representations of symmetric tridiagonals, Linear Algebra Appl., 309 (2000), pp. 121-151.
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. O. Schenk, M. Bollhöfer, and R. A. Römer, On large-scale diagonalization techniques for the Anderson model of localization, SIAM J. Sci. Comput., 28 (2006), pp. 963-983. (Pubitemid 46785411)
34. C. Vömel and J. Slemons, Twisted factorization of a banded matrix, BIT, 49 (2009), pp. 433-447.
35. J. H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, UK, 1965.
36. Q. Ye, On close eigenvalues of tridiagonal matrices, Numer. Math., 70 (1995), pp. 507-514.