Given a symmetric positive definite matrix $A$ and a mostly-zeros non-negative diagonal matrix $D$, is there a way to cheaply update the eigenvalues and/or eigenvectors of $A$ to that of $A+D$? Ideally I'm looking for something akin to the Woodbury matrix identity.
Updating eigen-decomposition of symmetric matrix $A$ to eigendecomposition of $A+D$ where $D$ is low-rank diagonal
9
$\begingroup$
linear-algebra
matrices
eigenvalues-eigenvectors
-
0hardmath: Yes, $D$ is a diagonal matrix and even its diagonal is just mostly zeros. – 2011-02-06
1 Answers
2
I would recommend reading http://www.unige.ch/~gander/consulting/X/EigenUpdate.ps.gz and having a look at the cited work of Golub and Van Loan. They show howto update matrices with rank-one-changes. You can understand your update matrix $D \in\mathbb{R}^{n\times n}$ as a sum of $n$ rank-one-updates. Good luck!