A general framework for iterative contour integral-based methods for nonlinear eigenvalue problems is introduced, enabling a proof of linear convergence for NLFEAST under mild assumptions.
Stabilizing the Rayleigh--Ritz procedure by randomization
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Extracting approximate eigenpairs from a prescribed subspace is of fundamental importance in eigenvalue computation. While projecting the target eigenvector onto the subspace yields satisfactory accuracy, extracting an approximate eigenpair that attains a comparable convergence rate has remained a long-standing open problem. Although the standard Rayleigh--Ritz procedure is widely used for this purpose, it may suffer from deteriorated convergence of Ritz values and may even fail to produce convergent Ritz vectors. In this paper, we address this long-standing open problem by introducing a randomized Rayleigh--Ritz procedure whose output converges at a rate similar to the ideal projection. Our analysis requires only the simplicity of the target eigenvalue and extends naturally to nonlinear eigenvalue problems.
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Linear convergence of iterative contour integral-based eigensolvers for nonlinear eigenvalue problems
A general framework for iterative contour integral-based methods for nonlinear eigenvalue problems is introduced, enabling a proof of linear convergence for NLFEAST under mild assumptions.