Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Iterative Method for Contour-Based Nonlinear Eigensolvers (2007.03000v2)

Published 6 Jul 2020 in math.NA and cs.NA

Abstract: Contour integration techniques have become a popular choice for solving the linear and non-linear eigenvalue problems. They principally include the Sakurai-Sugiura methods, the Beyn's algorithm, the FEAST/NLFEAST algorithms and other rational filtering techniques. While these methods can result in effective 'black-box' approach for solving linear eigenvalue problems, they still present several shortcomings for addressing nonlinear eigenvalue problems which are both mathematically and practically far more challenging. In this paper, we introduce a new hybrid algorithm that advantageously combines the iterative nature of NLFEAST with the effectiveness of Beyn's approach to deal with general non-linearity. In doing so, this NLFEAST-Beyn hybrid algorithm can overcome current limitations of both algorithms taken separately. After presenting its derivation from both a Beyn's and NLFEAST's perspective, several numerical examples are discussed to demonstrate the efficiency of the new technique.

Citations (2)

Summary

We haven't generated a summary for this paper yet.