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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Polynomial bounds on the gap for type A, Â and tree quivers make nullcone membership polynomial-time solvable, while other quivers have exponentially small gaps and weight margins.
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.
-
On the gap of quiver representations
Polynomial bounds on the gap for type A, Â and tree quivers make nullcone membership polynomial-time solvable, while other quivers have exponentially small gaps and weight margins.