Accurate eigenvalue decomposition of arrowhead matrices and applications
Preprint
Abstract
We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$ operations. The algorithm is based on a shift-and-invert approach. Double precision is eventually needed to compute only one element of the inverse of the shifted matrix. Each eigenvalue and the corresponding eigenvector can be computed separately, which makes the algorithm adaptable for parallel computing. Our results extend to Hermitian arrowhead matrices, real symmetric diagonal-plus-rank-one matrices and singular value decomposition of real triangular arrowhead matrices.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Spontaneous emission and qubit transfer in spin-1/2 chainsJournal of Physics B: Atomic, Molecular and Optical Physics, 2010
- A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal formMathematics of Computation, 1998
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal EigenproblemSIAM Journal on Matrix Analysis and Applications, 1995
- Error Analysis of Update Methods for the Symmetric Eigenvalue ProblemSIAM Journal on Matrix Analysis and Applications, 1993
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matricesJournal of Computational Physics, 1990
- On The Implementation Of A Fully Parallel Algorithm For The Symmetric Eigenvalue Problem1986
- Localized vibrational modes in Fermi liquids. General theoryPhysical Review B, 1981
- A divide and conquer method for the symmetric tridiagonal eigenproblemNumerische Mathematik, 1980
- Rank-one modification of the symmetric eigenproblemNumerische Mathematik, 1978
- Intramolecular Radiationless TransitionsThe Journal of Chemical Physics, 1968