Year: 2004
Type: article
Abstract: 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.
DOI: 10.15480/882.66
Author: Voß, Heinrich
Institution: Hamburg University of Technology
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2524731768