Voß, HeinrichHeinrichVoßBetcke, MartaMartaBetcke2005-12-162005-12-162004-10Preprint. Published in: Proceedings of ALGORITMY, 2005http://tubdok.tub.tuhh.de/handle/11420/64For 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.enhttp://rightsstatements.org/vocab/InC/1.0/eigenvaluenonlinear eigenproblemArnoldi methodrestart techniqueminmax characterizationMathematikA local restart procedure for iterative projection methods for nonlinear symmetric eigenproblemsPreprint2005-12-16urn:nbn:de:gbv:830-opus-117310.15480/882.62Nichtlineares EigenwertproblemIterationProjektionsmethodeEigenvalues, eigenvectorsEigenvalues, singular values, and eigenvectors11420/64http://pc2.iam.fmph.uniba.sk/amuc/_contributed/algo2005/markiewicz-voss.pdf10.15480/882.62930768124Other