Improving performance of contour integral-based nonlinear eigensolvers with infinite GMRES

Abstract

In this work, the infinite GMRES algorithm, recently proposed by Correnty et al., is employed in contour integral-based nonlinear eigensolvers, avoiding the computation of costly factorizations at each quadrature node to solve the linear systems efficiently. Several techniques are applied to make the infinite GMRES memory-friendly, computationally efficient, and numerically stable in practice. More specifically, we analyze the relationship between polynomial eigenvalue problems and their scaled linearizations, and provide a novel weighting strategy which can significantly accelerate the convergence of infinite GMRES in this particular context. We also adopt the technique of TOAR to infinite GMRES to reduce the memory footprint. Theoretical analysis and numerical experiments are provided to illustrate the efficiency of the proposed algorithm.

References in corpus (8)

• A Density Matrix-based Algorithm for Solving Eigenvalue Problems
• Quasinormal mode solvers for resonators with dispersive materials
• Extracting an accurate model for permittivity from experimental data : Hunting complex poles from the real line
• Poles and zeros in non-Hermitian systems: Application to photonics
• Non-linear eigenvalue problems with GetDP and SLEPc: Eigenmode computations of frequency-dispersive photonic open structures
• NEP: a module for the parallel solution of nonlinear eigenvalue problems in SLEPc
• Physically Agnostic Quasinormal Mode Expansion in Time Dispersive Structures:from Mechanical Vibrations to Nanophotonic Resonances
• Acoustic modal analysis with heat release fluctuations using nonlinear eigensolvers