Finding eigenvalues of a large matrix close to a given value

linear-algebra eigenvalues-eigenvectors numerical-linear-algebra

The keyword here is inverse iteration: given a guess $\mu$ for the eigenvalue (here $12$) this algorithm finds an eigenvector with eigenvalue close to $\mu$, without solving the whole system.

Related

Prove there does not exist a linear map
Filtration and martingale from definition
What happens to the limiting property of $\frac{\hat{\theta_n}}{n^{1/2}}$ if n goes to infinity?
Proving that a subgroup is normal if two equivalence relations on $A$ coincide
If $X$ is an observation from a $\text{Binom}(n, p)$, with $0 < p < 1$, how to find the UMVUE of $p^2$, and does it reach the Cramer-Rao lower bound?
evaluate this definited integral using the differentiating under the integral sign Leibniz rule.q
Java Abstract Class Implementing an Interface with Generics
Going back to a previous commit in Github Desktop
Differences between git branches using Visual Studio
Xcode 6 App Store submission fails with "Your account already has a valid iOS distribution certificate"
C# property and ref parameter, why no sugar?
C# template engine [closed]