Related papers: Spectra, Pseudospectra, and Localization for Rando…
Bound states of hyperbolic potential is investigated by means of a generalized pseudospectral method. Significantly improved eigenvalues, eigenfunctions are obtained efficiently for arbitrary $n, \ell$ quantum states by solving the relevant…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
We give general spectral and eigenvalue perturbation bounds for a selfadjoint operator perturbed in the sense of the pseudo-Friedrichs extension. We also give several generalisations of the aforementioned extension. The spectral bounds for…
Explicit representations of the eigenvalues of the peridynamic operator have been recently derived in [5]. These representations are given in terms of generalized hypergeometric functions. Asymptotic analysis of the hypergeometric functions…
We examine perturbations of eigenvalues and resonances for a class of multi-channel quantum mechanical model-Hamiltonians describing a particle interacting with a localized spin in dimension $d=1,2,3$. We consider unperturbed Hamiltonians…
In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the…
Pseudospectral analysis is fundamental for quantifying the sensitivity and transient behavior of nonnormal matrices, yet its computational cost scales cubically with dimension, rendering it prohibitive for large-scale systems. While…
Complex networks with directed, local interactions are ubiquitous in nature, and often occur with probabilistic connections due to both intrinsic stochasticity and disordered environments. Sparse non-Hermitian random matrices arise…
Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large…
In this article, we study numerical approximation of eigenvalue problems of the Schr\"{o}dinger operator $\displaystyle -\Delta u + \frac{c^2}{|x|^2}u$. There are three stages in our investigation: We start from a ball of any dimension, in…
One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…
We establish the convergence of pseudospectra in Hausdorff distance for closed operators acting in different Hilbert spaces and converging in the generalised norm resolvent sense. As an assumption, we exclude the case that the limiting…
Some properties and relations satisfied by the polynomial solutions of the bispectral problem are studied. Given a differential operator, under certain restrictions its polynomial eigenfunctions are explicitly obtained, as well as the…
The pseudospectra of a linear time-invariant system are the sets in the complex plane consisting of all the roots of the characteristic equation when the system matrices are subjected to all possible perturbations with a given upper bound.…
The subject of time-band-limiting, originating in signal processing, is dominated by the miracle that a naturally appearing integral operator admits a commuting differential one allowing for a numerically efficient way to compute its…
This work concerns the minimization of the pseudospectral abscissa of a matrix-valued function dependent on parameters analytically. The problem is motivated by robust stability and transient behavior considerations for a linear control…
We consider a general class of $n\times n$ random band matrices with bandwidth $W$. When $W^2\ll n$, we prove that with high probability the eigenvectors of such matrices are localized and decay exponentially at the sharp scale $W^2$.…
We study the spectra and eigenvectors of the adjacency matrices of scale-free networks when bi-directional interaction is allowed, so that the adjacency matrix is real and symmetric. The spectral density shows an exponential decay around…
In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…
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:…