On twisted factorizations of block tridiagonal matrices

Procedia Computer Science

Volumn 1, Issue 1, 2010, Pages 279-287

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

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Block tridiagonal eigenvalue problem; Eigenvector computation; Twisted block factorizations; Twisted factorizations

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FACTORIZATION; INVERSE PROBLEMS;

BLOCK TRIDIAGONAL MATRIX; EIGENVALUE PROBLEM; EIGENVECTOR COMPUTATIONS; HEURISTIC STRATEGY; INVERSE ITERATION; STARTING VECTORS; TWISTED BLOCK FACTORIZATIONS; TWISTED FACTORIZATIONS;

MATRIX ALGEBRA;

EID: 78650288718     PISSN: None     EISSN: 18770509     Source Type: Conference Proceeding    
DOI: 10.1016/j.procs.2010.04.031     Document Type: Conference Paper

References (18)

1. Y. Bai,W. N. Gansterer, R. C.Ward, Block tridiagonalization of "effectively" sparse symmetric matrices, ACMTrans. Math. Softw. 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., 1994, pp. 23-27.
3. C. H. Bischof, B. Lang, X. Sun, A framework for symmetric band reduction, ACM Trans. Math. Software 26 (2000) 581-601.
4. W. N. Gansterer, R. C. Ward, R. P. Muller, An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems, ACM Trans. Math. Softw. 28 (2002) 45-58.
5. W. N. Gansterer, R. C. Ward, R. P. Muller, W. A. Goddard, III, Computing approximate eigenpairs of symmetric block tridiagonal matrices, SIAM J. Sci. Comput. 25 (2003) 65-85.
6. B. N. Parlett, I. S. Dhillon, Fernando's solution to Wilkinson's problem: An application of double factorization, Linear Algebra Appl. 267 (1997) 247-279.
7. I. S. Dhillon, B. N. Parlett, C. Vömel, The design and implementation of the MRRR algorithm, ACM Trans. Math. Softw. 32 (4) (2006) 533-560.
8. I. S. Dhillon, B. N. Parlett, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Linear Algebra Appl. 387 (2004) 1-28.
9. K. V. Fernando, On computing an eigenvector of a tridiagonal matrix .1. Basic results, SIAM J. Matrix Anal. Appl. 18 (4) (1997) 1013-1034.
10. B. N. Parlett, For tridiagonals T replace T with LDLt, J. Comput. Appl. Math. 123 (1-2) (2000) 117-130.
11. B. N. Parlett, I. S. Dhillon, Relatively robust representations of symmetric tridiagonals, Linear Algebra Appl. 309 (2000) 121-151.
12. B. Parlett, O. Marques, An implementation of the dqds algorithm (positive case), Linear Algebra Appl. 309 (1-3) (2000) 217-259.
13. J. W. Demmel, W. Kahan, Accurate singular values of bidiagonal matrices, SIAM J. Sci. Stat. Comput. 11 (1990) 873-912.
14. G. Meurant, A review on the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl. 13 (3) (1992) 707-728.
15. C. Vömel, J. Slemons, Twisted factorization of a banded matrix, BIT 49 (2) (2009) 433-447.
16. G. H. Golub, C. F. Van Loan, Matrix Computations, 3rd Edition, Johns Hopkins University Press, Baltimore, MD, 1996.
17. J. R. Bunch, L. C. Kaufman, Some stable methods for calculating inertia and solving symmetric linear equations, Math. Comp. 31 (1977) 163-179.
18. I. C. F. Ipsen, Computing an eigenvector with inverse iteration, SIAM Rev. 39 (1997) 254-291.