Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations

Journal of Computational and Applied Mathematics

Volumn 236, Issue 15, 2012, Pages 3696-3703

  König, Gerhard ^a   Moldaschl, Michael ^a   Gansterer, Wilfried N ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Block tridiagonal matrix; Eigenvector computation; Inverse iteration; Twisted block factorization; Twisted factorization

Indexed keywords

BLOCK TRIDIAGONAL MATRIX; EIGENVALUES; EIGENVECTOR COMPUTATIONS; EXPERIMENTAL DATA; INVERSE ITERATION; NUMERICAL ACCURACY; ORTHOGONALITY; RUNTIMES; SINGLE-STEP; STARTING VECTORS; STATE-OF-THE-ART METHODS; TEST CASE;

ALGORITHMS; FACTORIZATION; MATRIX ALGEBRA;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84861526383     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2011.07.010     Document Type: Conference Paper

References (18)

1. Y. Bai, W.N. Gansterer, and R.C. Ward Block tridiagonalization of effectively sparse symmetric matrices ACM Trans. Math. Software 30 2004 326 352
2. C.H. Bischof, B. Lang, X. Sun, Parallel tridiagonalization through two-step band reduction, in: Proceedings of the 1994 Scalable High-Performance Computing Conference, Washington D.C., pp. 23-27.
3. C.H. Bischof, B. Lang, and X. Sun A framework for symmetric band reduction ACM Trans. Math. Software 26 2000 581 601
4. P. Luszczek, H. Ltaief, J. Dongarra, Two-Stage tridiagonal reduction for dense symmetric matrices using tile algorithms on multicore architectures, Technical Report 244, LAPACK Working Note, 2011.
5. W.N. Gansterer, R.C. Ward, and R.P. Muller An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems ACM Trans. Math. Software 28 2002 45 58
6. W.N. Gansterer, R.C. Ward, R.P. Muller, and W.A. Goddard III Computing approximate eigenpairs of symmetric block tridiagonal matrices SIAM J. Sci. Comput. 25 2003 65 85
7. B.N. Parlett, and I.S. Dhillon Fernando's solution to Wilkinson's problem: an application of double factorization Linear Algebra Appl. 267 1997 247 279
8. W.N. Gansterer, and G. König On twisted factorizations of block tridiagonal matrices Proceedings of the 10th International Conference on Computational Science 2010 Procedia Computer Science 1 2010 279 287
9. I.S. Dhillon, B.N. Parlett, and C. Vömel The design and implementation of the MRRR algorithm ACM Trans. Math. Software 32 2006 533 560
10. J.W. Demmel, and W. Kahan Accurate singular values of bidiagonal matrices SIAM J. Sci. Stat. Comput. 11 1990 873 912
11. I.S. Dhillon, and B.N. Parlett Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices Linear Algebra Appl. 387 2004 1 28
12. K.V. Fernando On computing an eigenvector of a tridiagonal matrix. Part I: basic results SIAM J. Matrix Anal. Appl. 18 1997 1013 1034
13. B.N. Parlett For tridiagonals T replace T with LDLt J. Comput. Appl. Math. 123 2000 117 130
14. B.N. Parlett, and I.S. Dhillon Relatively robust representations of symmetric tridiagonals Linear Algebra Appl. 309 2000 121 151
15. B. Parlett, and O. Marques An implementation of the dqds algorithm (positive case) Linear Algebra Appl. 309 2000 217 259
16. C. Vömel, and J. Slemons Twisted factorization of a banded matrix BIT 49 2009 433 447
17. I.C.F. Ipsen Computing an eigenvector with inverse iteration SIAM Rev. 39 1997 254 291
18. E. Anderson, Z. Bai, C.H. Bischof, S. Blackford, J.W. Demmel, J.J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D.C. Sorensen Lapack Users' Guide 3rd ed. 1999 SIAM Press Philadelphia, PA