Numerical methods for sparse nonlinear eigenvalue problems

This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods. We briefly sketch a new approach to structure preserving projection methods, but we do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem