Related papers: Spectrum through pseudospectrum
We describe a subtle error which can appear in numerical calculations involving the spacing statistics of eigenvalues of random unitary matrices.
Let A and E be Hermitian self-adjoint matrices, where A is fixed and E a small perturbation. We study how the eigenvalues and eigenvectors of A+E depend on E, with the aim of obtaining first order formulas (and when possible also second…
In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…
Recently some authors have broadened the scope of canonical quantum mechanics by replacing the conventional Hermiticity condition on the Hamiltonian by a weaker requirement through the introduction of the notion of pseudo-Hermiticity. In…
The application of eigenvalue theory to dual quaternion Hermitian matrices holds significance in the realm of multi-agent formation control. In this paper, we study the Rayleigh quotient iteration (RQI) for solving the right eigenpairs of…
In a previous paper (arXiv:math-ph/0604055) we introduced a very simple PT-symmetric non-Hermitian Hamiltonian with real spectrum and derived a closed formula for the metric operator relating the problem to a Hermitian one. In this note we…
Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…
We discuss the problems arising when computing eigenvalues of self-adjoint operators which lie in a gap between two parts of the essential spectrum. Spectral pollution, i.e. the apparent existence of eigenvalues in numerical computations,…
The paper discusses progress in understanding statistical properties of complex eigenvalues (and corresponding eigenvectors) of weakly non-unitary and non-Hermitian random matrices. Ensembles of this type emerge in various physical…
In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of large matrices. We discuss two methods for reducing the computational burden of spectral decompositions: the more venerable Nystom extension…
The eigenvalues of matrices representing the structure of large-scale complex networks present a wide range of applications, from the analysis of dynamical processes taking place in the network to spectral techniques aiming to rank the…
Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…
Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…
We present a novel method for solving eigenvalue problems on a quantum computer based on spectroscopy. The method works by coupling a "probe" qubit to a set of system simulation qubits and then time evolving both the probe and the system…
The eigenvalue spectrum of the fractional quantum harmonic oscillator is calculated numerically solving the fractional Schr\"odinger equation based on the Riemann and Caputo definition of a fractional derivative. The fractional approach…
We consider the problem of how to compute eigenvalues of a self-adjoint operator when a direct application of the Galerkin (finite-section) method is unreliable. The last two decades have seen the development of the so-called quadratic…
We introduce spectral quantum tomography, a simple method to extract the eigenvalues of a noisy few-qubit gate, represented by a trace-preserving superoperator, in a SPAM-resistant fashion, using low resources in terms of gate sequence…
In the last decades the Moore-Penrose pseudoinverse has found a wide range of applications in many areas of Science and became a useful tool for physicists dealing, for instance, with optimization problems, with data analysis, with the…
A simple and efficient variational method is introduced to accelerate the convergence of the eigenenergy computations for a Hamiltonian H with singular potentials. Closed-form analytic expressions in N dimensions are obtained for the matrix…
We develop spectral methods for ODEs and operator eigenvalue problems that are based on a least-squares formulation of the problem. The key tool is a method for rectangular generalized eigenvalue problems, which we extend to quasimatrices…