Related papers: The Eigenvalue Problem for Linear and Affine Itera…
A new approach is presented for the solution of spectral problems on infinite domains with regular ends, which avoids the need to solve boundary value problems for many trial values of the spectral parameter. We present numerical results…
The Floquet eigenvalue problem and a generalized form of the Wangerin eigenvalue problem for Lam\'e's differential equation are discussed. Results include comparison theorems for eigenvalues and analytic continuation, zeros and limiting…
In this paper we analyze and solve eigenvalue programs, which consist of the task of minimizing a function subject to constraints on the "eigenvalues" of the decision variable. Here, by making use of the FTvN systems framework introduced by…
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:…
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…
In this manuscript, a generalized inverse eigenvalue problem is considered that involves a linear pencil $(z\mathcal{J}_{[0,n]}-\mathcal{H}_{[0,n]})$ of matrices arising in the theory of rational interpolation and biorthogonal rational…
We propose a new type of multilevel method for solving eigenvalue problems based on Newton iteration. With the proposed iteration method, solving eigenvalue problem on the finest finite element space is replaced by solving a small scale…
In this paper, we investigate a class of nonlinear eigenvalue problems resulting from quantum physics. We first prove that the eigenfunction cannot be a polynomial on any open set, which may be reviewed as a refinement of the classic unique…
We present a rational filter for computing all eigenvalues of a symmetric definite eigenvalue problem lying in an interval on the real axis. The linear systems arising from the filter embedded in the subspace iteration framework, are solved…
In [Camano, Lackner, Monk, SIAM J. Math. Anal., Vol. 49, No. 6, pp. 4376-4401 (2017)] it was suggested to use Stekloff eigenvalues for Maxwell equations as target signature for nondestructive testing via inverse scattering. The authors…
We examine two questions regarding Fourier frequencies for a class of iterated function systems (IFS). These are iteration limits arising from a fixed finite families of affine and contractive mappings in $\br^d$, and the ``IFS'' refers to…
The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the…
The aim of this note is to study the spectrum of a linearized Liouville-type problem, characterizing the case in which the first eigenvalue is zero. Interestingly enough, we obtain also point-wise information on the associated first…
We consider the problem of finding $\lambda\in \mathbb{R}$ and a function $u:\mathbb{R}^n\rightarrow\mathbb{R}$ that satisfy the PDE $$ \max\left\{\lambda + F(D^2u) -f(x),H(Du)\right\}=0, \quad x\in \mathbb{R}^n. $$ Here $F$ is elliptic,…
In this paper we consider the eigenvalue problem consisting of the equation -u" = \la r u, \quad \text{on $(-1,1)$}, where $r \in C^1[-1,1], \ r>0$ and $\la \in \R$, together with the multi-point boundary conditions u(\pm 1) =…
We study an eigenvalue problem for functions in R^N and we find sufficient conditions for the existence of the fundamental eigenvalue. This result can be applied to the study of the orbital stability of the standing waves of the nonlinear…
The problem of recovering a low-rank matrix from the linear constraints, known as affine matrix rank minimization problem, has been attracting extensive attention in recent years. In general, affine matrix rank minimization problem is a…
In this paper we present an iterative method, inspired by the inverse iteration with shift technique of finite linear algebra, designed to find the eigenvalues and eigenfunctions of the Laplacian with homogeneous Dirichlet boundary…
In this paper, we first establish the convergence criteria of the residual iteration method for solving quadratic eigenvalue problem- s. We analyze the impact of shift point and the subspace expansion on the convergence of this method. In…
The polynomial eigenvalue problem arises in many applications and has received a great deal of attention over the last decade. The use of root-finding methods to solve the polynomial eigenvalue problem dates back to the work of…