Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
DOI10.1016/j.laa.2015.09.025zbMath1325.65053arXiv1405.7537OpenAlexW1827065324MaRDI QIDQ890573
Jesse L. Barlow, Nevena Jakovčević Stor, Ivan Slapničar
Publication date: 10 November 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.7537
high relative accuracyeigenvalue decompositionreal symmetric matrixarrowhead matrixdiagonal-plus-rank-one matrixforward stability
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Software, source code, etc. for problems pertaining to linear algebra (15-04) Special matrices (15B99)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Rank-one modification of the symmetric eigenproblem
- Numerical solution of a secular equation
- A floating-point technique for extending the available precision
- Matrix Algorithms
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- On eigenvectors and adjoints of modified matrices
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- Accuracy and Stability of Numerical Algorithms
- N Roots of the Secular Equation in O(N) Operations
- Error Analysis of Update Methods for the Symmetric Eigenvalue Problem
- Structures preserved by matrix inversion
This page was built for publication: Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices