Betcke, MartaMartaBetckeVoß, HeinrichHeinrichVoß2018-10-292018-10-292016-05-14Numerische Mathematik 2 (135): 397-430 (2017)http://tubdok.tub.tuhh.de/handle/11420/1803In this work we present a new restart technique for iterative projection methods for nonlinear eigenvalue problems admitting minmax characterization of their eigenvalues. Our technique makes use of the minmax induced local enumeration of the eigenvalues in the inner iteration. In contrast to global numbering which requires including all the previously computed eigenvectors in the search subspace, the proposed local numbering only requires a presence of one eigenvector in the search subspace. This effectively eliminates the search subspace growth and therewith the super-linear increase of the computational costs if a large number of eigenvalues or eigenvalues in the interior of the spectrum are to be computed. The new restart technique is integrated into nonlinear iterative projection methods like the Nonlinear Arnoldi and Jacobi-Davidson methods. The efficiency of our new restart framework is demonstrated on a range of nonlinear eigenvalue problems: quadratic, rational and exponential including an industrial real-life conservative gyroscopic eigenvalue problem modeling free vibrations of a rolling tire. We also present an extension of the method to problems without minmax property but with eigenvalues which have a dominant either real or imaginary part and test it on two quadratic eigenvalue problems.en0945-324520162397430Springerhttps://creativecommons.org/licenses/by/4.0/Iterative projection methodJacobi-Davidson methodminmax characterizationnonlinear Arnoldi methodnonlinear eigenvalue problemrestartpurge and lockMathematikJournal Articleurn:nbn:de:gbv:830-8822340810.15480/882.180011420/180310.1007/s00211-016-0804-310.15480/882.1800Journal Article