Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with high relative accuracy in $O(n)$ operations... (read more)

Results in Papers With Code
(↓ scroll down to see all results)