Related papers: The level set method for the two-sided eigenproble…

We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a…

Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…

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…

The aim of this manuscript is to derive bounds on the moduli of eigenvalues of special type of rational matrices of the form $T(\lambda) = \displaystyle -B_0 +I\lambda +\frac{B_1}{\lambda-\alpha_1}+ \dots+ \frac{B_m}{\lambda-\alpha_m}$,…

In this paper, we consider a bilevel polynomial optimization problem where the objective and the constraint functions of both the upper and the lower level problems are polynomials. We present methods for finding its global minimizers and…

This purpose of this write-up is to share an idea for accurate computation of Laplace eigenvalues on a broad class of smooth domains. We represent the eigenfunction $u$ as a linear combination of eigenfunctions corresponding to the common…

Spectral properties of bounded linear operators play a crucial role in several areas of mathematics and physics. For each self-adjoint, trace-class operator $O$ we define a set $\Lambda_n\subset \mathbb{R}$, and we show that it converges to…

We prove new explicit asymptotic formulae between (geometric) eigenvalues in max-algebra and classical distinguished eigenvalues of nonnegative matrices, which are useful tools for transferring results between both settings. We establish…

A numerical scheme to compute the spectrum of a large class of self-adjoint extensions of the Laplace-Beltrami operator on manifolds with boundary in any dimension is presented. The algorithm is based on the characterisation of a large…

We study the ultradiscrete analogue of Lax pair proposed by Willox et al. This "pair" is a max-plus linear system comprising four equations. Our starting point is to treat this system as a combination of two max-plus eigenproblems, with two…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

An asymptotic interation method for solving second-order homogeneous linear differential equations of the form y'' = lambda(x) y' + s(x) y is introduced, where lambda(x) \neq 0 and s(x) are C-infinity functions. Applications to Schroedinger…

We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find…

Consider an $n \times n$ matrix polynomial $P(\lambda)$. A spectral norm distance from $P(\lambda)$ to the set of $n \times n$ matrix polynomials that have a given scalar $\mu\in\mathbb{C}$ as a multiple eigenvalue was introduced and…

The pseudospectra (or spectral instability) of non-selfadjoint operators is a topic of current interest in applied mathematics. In fact, for non-selfadjoint operators the resolvent could be very large outside the spectrum, making the…

We analyze two-dimensional Schr\"odinger operators with the potential $|xy|^p - \lambda (x^2+y^2)^{p/(p+2)}$ where $p\ge 1$ and $\lambda\ge 0$. We show that there is a critical value of $\lambda$ such that the spectrum for…

Many complex systems can be reduced to their key components through spectrally decomposing matrices that capture their dynamics. These matrices can in turn be constructed from data, often by least-squares fitting: examples of algorithms to…

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…

We describe a highly efficient numerical scheme for finding two-sided bounds for the eigenvalues of the fractional Laplace operator (-Delta)^{alpha/2} in the unit ball D in R^d, with a Dirichlet condition in the complement of D. The…

In this paper, we discuss numerical approximation of the eigenvalues of the one-dimensional radial Schr\"{o}dinger equation posed on a semi-infinite interval. The original problem is first transformed to one defined on a finite domain by…