Related papers: First-order Perturbation Theory for Eigenvalues an…
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…
We generalize $\epsilon$-pseudospectra and the associated computational algorithms to the generalized eigenvalue problem. Rank one perturbations are used to determine the $\epsilon$-pseudospectra.
Repeated application of machine-learning, eigen-centric methods to an evolving dataset reveals that eigenvectors calculated by well-established computer implementations are not stable along an evolving sequence. This is because the sign of…
We develop new perturbation techniques for conducting convergence analysis of various first-order algorithms for a class of nonsmooth optimization problems. We consider the iteration scheme of an algorithm to construct a perturbed…
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…
A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is…
We derive a correct first-order perturbation theory in electromagnetism for cases where an interface between two anisotropic dielectric materials is slightly shifted. Most previous perturbative methods give incorrect results for this case,…
We analyze the optical resonances of a dielectric sphere whose surface has been slightly deformed in an arbitrary way. Setting up a perturbation series up to second order, we derive both the frequency shifts and modified linewidths. Our…
In this work we study the problem of first order perturbations of a general hypersurface, i.e. with arbitrary causal character at each point. We extend the framework by Mars (Class. Quantum Grav. 22 3325 (2005)) where this problem was…
In this article I study different possibilities of analytically solving the Sturm-Liouville problem with variable coefficients of sufficiently arbitrary behavior with help of perturbation theory. I show how the problem can be reformulated…
Spectral analysis of convex processes has led to many results in the analysis of differential inclusions with a convex process. In particular the characterization of eigenvalues with eigenvectors in a given cone has led to results on…
One of the most common problems of scientific applications is computation of the derivative of a function specified by possibly noisy or imprecise experimental data. Application of conventional techniques for numerically calculating…
A defective eigenvalue is well documented to be hypersensitive to data perturbations and round-off? errors, making it a formidable challenge in numerical computation particularly when the matrix is known through approximate data. This paper…
Computing the eigenvectors and eigenvalues of a perturbed matrix can be remarkably difficult when the unperturbed matrix has repeated eigenvalues. In this work we show how the limiting eigenvectors and eigenvalues of a symmetric matrix…
In this paper, we consider the singular values and singular vectors of finite, low rank perturbations of large rectangular random matrices. Specifically, we prove almost sure convergence of the extreme singular values and appropriate…
While perturbation theories constitute a significant foundation of modern quantum system analysis, extending them from the Hermitian to the non-Hermitian regime remains a non-trivial task. In this work, we generalize the…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous…
We provide a perturbative expansion for the empirical spectral distribution of a Hermitian matrix with large size perturbed by a random matrix with small operator norm whose entries in the eigenvector basis of the first one are independent…
We revisit the relative perturbation theory for invariant subspaces of positive definite matrix pairs. As a prototype model problem for our results we consider parameter dependent families of eigenvalue problems. We show that new estimates…