Related papers: A continuous approach to computing the pseudospect…
We propose a two-sided Lanczos method for the nonlinear eigenvalue problem (NEP). This two-sided approach provides approximations to both the right and left eigenvectors of the eigenvalues of interest. The method implicitly works with…
We develop an abstract method to identify spectral points of definite type in the spectrum of the operator $T_1\otimes I_2 + I_1\otimes T_2$. The method is applicable in particular for non-self-adjoint waveguide type operators with…
Spectral methods provide an elegant and efficient way of numerically solving differential equations of all kinds. For smooth problems, truncation error for spectral methods vanishes exponentially in the infinity norm and $L_2$-norm.…
The purpose of this article is to study pseudospectral properties of the one-dimensional Schr\"{o}dinger operator perturbed by a complex steplike potential. By constructing the resolvent kernel, we show that the pseudospectrum of this…
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…
While Spectral Methods have long been used for Principal Component Analysis, this survey focusses on work over the last 15 years with three salient features: (i) Spectral methods are useful not only for numerical problems, but also discrete…
We show how the spectrum of normal discrete short-range infinite-volume operators can be approximated with two-sided error control using only data from finite-sized local patches. As a corollary, we prove the computability of the spectrum…
This article is devoted to the construction of pseudomodes of one-dimensional biharmonic operators with the complex-valued potentials via the WKB method. As a by-product, the shape of pseudospectrum near infinity can be described. This is a…
We develop a block minimum residual (MINRES) algorithm for symmetric indefinite matrices. This version is built upon the band Lanczos method that generates one basis vector of the block Krylov subspace per iteration rather than a whole…
multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Nonzero multiplication operators on $L^2$ spaces of functions are never compact and then such…
A systematic digital-discrete method for obtaining continuous functions with smoothness to a certain order (C^(n)) from sample data is designed. This method is based on gradually varied functions and the classical finite difference method.…
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…
We present a new structure preserving Lanczos algorithm for approximating the optical absorption spectrum in the context of solving full Bethe--Salpeter equation without Tamm--Dancoff approximation. The new algorithm is based on a structure…
We solve inverse scattering problem for Schr\"odinger operators with compactly supported potentials on the half line. We discretize S-matrix: we take the value of the S-matrix on some infinite sequence of positive real numbers. Using this…
A new technique for approximating eigenvalues and eigenvectors of a self-adjoint operator is presented. The method does not incur spectral pollution, uses trial spaces from the form domain, has a self-adjoint algorithm, and exhibits…
Spectral Clustering (SC) is one of the most widely used methods for data clustering. It first finds a low-dimensonal embedding $U$ of data by computing the eigenvectors of the normalized Laplacian matrix, and then performs k-means on…
We present a matrix technique to obtain the spectrum and the analytical index of some elliptic operators defined on compact Riemannian manifolds. The method uses matrix representations of the derivative which yield exact values for the…
We prove local convergence results for the spectra and pseudospectra of sequences of linear operators acting in different Hilbert spaces and converging in generalised strong resolvent sense to an operator with possibly non-empty essential…
In this paper we propose and analyze an algorithm for identifying spectral gaps of a real symmetric matrix $A$ by simultaneously approximating the traces of spectral projectors associated with multiple different spectral slices. Our method…
For an arbitrary Hermitian period-$T$ Jacobi operator, we assume a perturbation by a Wigner-von Neumann type potential to devise subordinate solutions to the formal spectral equation for a (possibly infinite) real set, $S$, of the spectral…