On computing the spectral decomposition of symmetric arrowhead matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3044, Issue , 2004, Pages 932-941

  Diele, Fasma ^a   Mastronardi, Nicola ^a   Van Barel, Marc ^b   Van Camp, Ellen ^b  

^a CNR   (Italy)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS;

APPLIED MATHEMATICS; DIVIDE-AND-CONQUER ALGORITHM; ITERATIVE ALGORITHM; QUADRATIC CONVERGENCE; SCHUR DECOMPOSITION; SEMISEPARABLE MATRICES; SPECTRAL DECOMPOSITION; TRIDIAGONAL MATRICES;

MATRIX ALGEBRA;

EID: 35048837088     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24709-8_98     Document Type: Article

References (10)

1. Arbenz, P., Golub, G.H.: QR-like algorithms for symmetric arrow matrices. SIAM J. Matrix Anal. Appl. 13 (1992) 655-658
2. Borges, C.F., Gragg, W.B.: A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem. In Numerical Linear Algebra and Scientific Computing, L. Reichel, A. Ruttan, and R. S. Varga, eds., de Gruyter, Berlin (1993) 10-28
3. Chandrasekaran, S., Gu, M.: A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices. Numerische Mathematik (to appear)
4. Dongarra, J.J., Sorensen, D.C.: A fully parallel algorithm for the symmetric eigenvalue problem. SIAM J. Sei. Stat. Comput. 8 (1987) 139-154
5. Golub, G.H.: Some modified matrix eigenvalue problems. SIAM Rev. 15 (1973) 328-334
6. Gu, M., Eisenstat, S.C.: A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15 (1994) 1266-1276.
7. Gu, M., Eisenstat, S.C.: A divide and conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM J. Matrix Anal. Appl. 16 (1995) 172-191
8. Gragg, W.B., Thornton, J.R., Warner, D.D., Parallel divide and conquer algorithms for the symmetric tridiagonal eigenproblem and bidiagonal singular value problem. In Modelling and Simulation, W.G Vogt and M. H. Mickle, eds., 23 University of Pittsbuig School of Engineering, Pittsburg, (1992) 49-56
9. Mastronardi, N., Van Camp, E., Van Barel, M.: Divide and Conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices. IAC-CNR Tech. Rep. 7 (2003)
10. submitted to Numer. Alg. 10. O'Leary, D.P., Stewart, G.W.: Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. J. Comp. Phys. 90 (1990) 497-505