Eigenvalues of a Symmetric Positive Semi-Definite (PSD) matrix after rank one update I have a Symmetric Positive Semi-Definite matrix $A$ which i know its eigenvalue and eigenvectors. let $v$ and $u$ be a random column vector. i want to know if it is possible to have eigenvalues of matrix $A+uv^T$.
I don't need its eigenvectors, but it is required to have the most precise eigenvalues. We know that $uv^T$ is also a rank one PSD matrix.
Is there a close form to this problem?
${\bf PS:}$ As you see i found the solution, but after implementation of this i can see a very small error in result, it would be appreciated if anyone know why this is happening, because we didn't used any approximation to get the result and it should be exact.
 A: Complementing Denis's answer, you can look at the paper Some Modified Matrix Eigenvalue Problems by Golub (http://www.jstor.org/stable/2028604) where this issue is treated at some length.
A: Found the solution in [1], Please let me know if i had any mistake.
we have 
$Ax=\lambda x$   (1)
differentiate both side we have
$\Delta Ax+ A\Delta x= \Delta\lambda x+\lambda\Delta x$.
multiply both side with $x^T$ and we have 
$x^T\Delta Ax+ x^TA\Delta x= x^T\Delta\lambda x+x^T\lambda\Delta x$   (2)
from (1), by transposing both side we have $x^TA^T=\lambda x^T$. because $A$ is symmetric, we can eliminate the transpose of $A$.
$x^TA=\lambda x^T$
know we can eliminate last terms in both side because equality of them.
$x^T\Delta Ax= x^T\Delta\lambda x$ 
after a simple manipulation we get
$\frac{x^T\Delta Ax}{x^Tx}= \Delta\lambda $
As we know $x^Tx=1$ the final result will be
$ \Delta\lambda={x^T\Delta Ax} $
[1] Ning, H., Xu, W., Chi, Y., Gong, Y., & Huang, T. S. (2010). Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recognition, 43(1), 113-127.
