Related papers: Contour Integration for Eigenvector Nonlinearities
A fully numerical method to calculate loop integrals, a numerical contour-integration method, is proposed. Loop integrals can be interpreted as a contour integral in a complex plane for an integrand with multi-poles in the plane. Stable and…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
We generalize ideas in the recent literature and develop new ones in order to propose a general class of contour integral methods for linear convection-diffusion PDEs and in particular for those arising in finance. These methods aim to…
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…
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…
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…
In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
Numerical evaluations of Feynman integrals often proceed via a deformation of the integration contour into the complex plane. While valid contours are easy to construct, the numerical precision for a multi-loop integral can depend…
We solve Maxwell's eigenvalue problem via isogeometric boundary elements and a contour integral method. We discuss the analytic properties of the discretisation, outline the implementation, and showcase numerical examples.
We extend the conforming virtual element method to the numerical resolution of eigenvalue problems with potential terms on a polytopal mesh. An important application is that of the Schrodinger equation with a pseudopotential term. This…
We present a novel, global algorithm for solving polynomial multiparameter eigenvalue problems (PMEPs) by leveraging a hidden variable tensor Dixon resultant framework. Our method transforms a PMEP into one or more univariate polynomial…
In this paper, we consider a nonlinear integral eigenvalue problem, which is a reformulation of the transmission eigenvalue problem arising in the inverse scattering theory. The boundary element method is employed for discretization, which…
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…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
We present the Complex Envelope Variable Approximation (CEVA) as the very useful and compact method for the analysis of the essentially nonlinear dynamical systems. It allows us to study both the stationary and non-stationary dynamics even…
The paper develops the method for construction of families of particular solutions to some classes of nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic matrix equations and PDE.…
The first step when solving an infinite-dimensional eigenvalue problem is often to discretize it. We show that one must be extremely careful when discretizing nonlinear eigenvalue problems. Using examples, we show that discretization can:…
We study some aspects of the invariant pair problem for matrix polynomials, as introduced by Betcke and Kressner and by Beyn and Thuemmler. Invariant pairs extend the notion of eigenvalue-eigenvector pairs, providing a counterpart of…
The eigenvalue problem plays a central role in linear algebra and its applications in control and optimization methods. In particular, many matrix decompositions rely upon computation of eigenvalue-eigenvector pairs, such as diagonal or…