Related papers: Solving nonlinear eigenvalue problems via contour …
Recently, a non-classical eigenvalue solver, called RIM, was proposed to compute (all) eigenvalues in a region on the complex plane. Without solving any eigenvalue problem, it tests if a region contains eigenvalues using an approximate…
We consider nonlinear eigenvalue problems to compute all eigenvalues in a bounded region on the complex plane. Based on domain decomposition and contour integrals, two robust and scalable parallel multi-step methods are proposed. The first…
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…
We propose an algorithm for general nonlinear eigenvalue problems to compute physically relevant eigenvalues within a chosen contour. Eigenvalue information is explored by contour integration incorporating different weight functions. The…
Contour integral methods for nonlinear eigenvalue problems seek to compute a subset of the spectrum in a bounded region of the complex plane. We briefly survey this class of algorithms, establishing a relationship to system realization…
Recently, a kind of eigensolvers based on contour integral were developed for computing the eigenvalues inside a given region in the complex plane. The CIRR method is a classic example among this kind of methods. In this paper, we propose a…
A new algorithm, denoted by RSRR, is presented for solving large-scale nonlinear eigenvalue problems (NEPs) with a focus on improving the robustness and reliability of the solution, which is a challenging task in computational science and…
Recently, contour integral-based methods have been actively studied for solving interior eigenvalue problems that find all eigenvalues located in a certain region and their corresponding eigenvectors. In this paper, we reconsider the…
Solving polynomial eigenvalue problems with eigenvector nonlinearities (PEPv) is an interesting computational challenge, outside the reach of the well-developed methods for nonlinear eigenvalue problems. We present a natural generalization…
Numerical solution of nonlinear eigenvalue problems (NEPs) is frequently encountered in computational science and engineering. The applicability of most existing methods is limited by matrix structures, property of eigen-solutions, size of…
In many applications, the information about the number of eigenvalues inside a given region is required. In this paper, we propose a contour-integral based method for this purpose. The new method is motivated by two findings. There exist…
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…
Investigating the stability of nonlinear waves often leads to linear or nonlinear eigenvalue problems for differential operators on unbounded domains. In this paper we propose to detect and approximate the point spectra of such operators…
This paper presents a method for computing eigenvalues and eigenvectors for some types of nonlinear eigenvalue problems. The main idea is to approximate the functions involved in the eigenvalue problem by rational functions and then apply a…
This paper describes a set of rational filtering algorithms to compute a few eigenvalues (and associated eigenvectors) of non-Hermitian matrix pencils. Our interest lies in computing eigenvalues located inside a given disk, and the proposed…
The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This…
We present two approximation methods for computing eigenfrequencies and eigenmodes of large-scale nonlinear eigenvalue problems resulting from boundary element method (BEM) solutions of some types of acoustic eigenvalue problems in…
Contour integral algorithms seek to compute a small number of eigenvalues located within a bounded region of the complex plane. These methods can be applied to both linear and nonlinear matrix eigenvalue problems. In the latter case, the…
Eigenvalue transformations appear ubiquitously in scientific computation, ranging from matrix polynomials to differential equations, and are beyond the reach of the quantum singular value transformation framework. In this work, we study the…
We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the…