Related papers: Contour Integration for Eigenvector Nonlinearities
In this article, we explore the use of contour deformation for the numerical evaluation of Feynman integrals after sector decomposition. In existing codes, the contour of integration is determined heuristically for each phase-space point by…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In this chapter we are examining several iterative methods for solving nonlinear eigenvalue problems. These arise in variational image-processing, graph partition and classification, nonlinear physics and more. The canonical eigenproblem we…
A generalized eigenvalue algorithm for tridiagonal matrix pencils is presented. The algorithm appears as the time evolution equation of a nonautonomous discrete integrable system associated with a polynomial sequence which has some…
This paper concerns a class of monotone eigenvalue problems with eigenvector nonlinearities (mNEPv). The mNEPv is encountered in applications such as the computation of joint numerical radius of matrices, best rank-one approximation of…
In this paper we study polynomial maps of vector spaces and their eigenvectors and eigenvalues. The new quantity called complanart is defined. Complanarts determine complanarity of solution vectors of systems of polynomial equations.…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…
In this paper, we propose a type of tensor-neural-network-based machine learning method to compute multi-eigenpairs of high dimensional eigenvalue problems without Monte-Carlo procedure. Solving multi-eigenvalues and their corresponding…
We propose a contour integral-based algorithm for computing a few singular values of a matrix or a few generalized singular values of a matrix pair. Mathematically, the generalized singular values of a matrix pair are the eigenvalues of an…
In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…
Let $\left( X,\left\Vert \cdot\right\Vert_{X}\right) $ and $\left( Y,\left\Vert \cdot\right\Vert_{Y}\right) $ be Banach spaces over $\mathbb{R},$ with $X$ uniformly convex and compactly embedded into $Y.$ The inverse iteration method is…
We investigate the calculation of resonance modes of a VCSEL with a Riesz projection eigenvalue solver. The eigenvalue solver is based on the principle of contour integration where for the solution of scattering problems physical right…
We investigate a technique to transform a linear two-parameter eigenvalue problem, into a nonlinear eigenvalue problem (NEP). The transformation stems from an elimination of one of the equations in the two-parameter eigenvalue problem, by…
This paper presents a one-dimensional analog of the Rectangular-Polar (RP) integration strategy and its convergence analysis for weakly singular convolution integrals. The key idea of this method is to break the whole integral into integral…
We represent an integration algorithm combining the characteristics method and Hopf-Cole transformation. This algorithm allows one to partially integrate a large class of multidimensional systems of nonlinear Partial Differential Equations…
This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…
It is well-known that the finite difference discretization of the Laplacian eigenvalue problem $-\Delta u = \lambda u$ leads to a matrix eigenvalue problem (EVP) $A x= \lambda x$ where the matrix $A$ is Toeplitz-plus-Hankel. Analytical…
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…
It is well known that the usual mixed method for solving the biharmonic eigenvalue problem by decomposing the operator into two Laplacians may generate spurious eigenvalues on non-convex domains. To overcome this difficulty, we adopt a…