A local restart procedure for iterative projection methods for nonlinear symmetric eigenproblems
Heinrich Voß, Marta M. Betcke
Abstract
Open-access reader
Heinrich Voß, Marta M. Betcke
Abstract
Open-access reader
For nonlinear eigenvalue problems $T(lambda)x = 0$ satisfying a minmax characterization of its eigenvalues iterative projection methods combined with safeguarded iteration are suitable for computing all eigenvalues in a given interval. Such methods hit their limitation if a large number of eigenvalues (in the interior of the spectrum) are required. In this paper we propose a localized version of safeguarded iteration which is able to cope with this problem.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For nonlinear eigenvalue problems $T(lambda)x = 0$ satisfying a minmax characterization of its eigenvalues iterative projection methods combined with safeguarded iteration are suitable for computing all eigenvalues in a given interval. Such methods hit their limitation if a large number of eigenvalues (in the interior of the spectrum) are required. In this paper we propose a localized version of safeguarded iteration which is able to cope with this problem.
Key concepts: Eigenvalues and eigenvectors, Iterative method, Minimax, Projection (relational algebra), Mathematics, Nonlinear system, Power iteration, Inverse iteration