On sensitivity of eigenvalues and eigendecompositions of matrices (Q1763838): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shreemayee Bora / rank
Normal rank
 
Property / author
 
Property / author: Shreemayee Bora / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2004.10.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139330196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Stable Eigendecompositions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of eigenvalues and spectral decompositions under linear perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effect of linear perturbation on spectra of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic perturbation theory for matrices and operators. Licensed ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Pseudospectra, with Applications to Robust Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust stability and a criss-cross algorithm for pseudospectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing stable eigendecompositions of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On condition numbers and the distance to the nearest ill-posed problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing spectral value sets using the subharmonicity of the norm of rational matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudospectre d'une suite d'opérateurs bornés / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formula for the 2-norm distance from a matrix to the set of matrices with multiple eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of a matrix with a very ill-conditioned eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudospectra of Linear Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on matrices with a very ill-conditioned eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On neighbouring matrices with quadratic elementary divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Feingold / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:32, 7 June 2024

scientific article
Language Label Description Also known as
English
On sensitivity of eigenvalues and eigendecompositions of matrices
scientific article

    Statements

    On sensitivity of eigenvalues and eigendecompositions of matrices (English)
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    Two problems concerning the sensitivity of eigenvalues and eigendecompositions of matrices are studied and solved in a certain sense. The first problems posed by \textit{J. H. Wilkinson} [The algebraic eigenvalue problem (1965; Zbl 0258.65037); pp. 90--93] is to find and characterise for a given matrix \(A\) with simple eigenvalues a nearest matrix \(A'\) with multiple eigenvalues.\ Let \[ d(A) = \min\{\| A-A'\| :A' \text{ has multiple eigenvalues}\}. \] Let \(\Lambda(A)\) denote the spectrum of \(A\) and for \(\varepsilon > 0\) let \[ \Lambda_{\varepsilon}(A)=\bigcup\{\lambda(A'): \| A-A'\| \leq \varepsilon\} \] the \(\varepsilon\)-pseudospectrum of \(A\). The geometric separation \(gsep(\lambda)\) of an eigenvalue \(\lambda \in \Lambda(A)\) is the smallest \(\varepsilon\) for which a component of \(\Lambda_{\varepsilon}(A)\) containing \(\lambda\) coalesces with another component. It is shown that if for some \(\varepsilon > 0\) two components of \(\Lambda_{\varepsilon}(A)\) coalesce at \(z_0\), then \(z_0\) is a multiple eigenvalue of some \(A'\) with \(\| A-A'\| = \varepsilon\). This leads to the main result that \[ d(A)=\min\{gsep(\lambda): \lambda \in \Lambda(A)\}. \] Hence \(d(A)\) can be read off from the pseudospectrum. In the last chapter a more general problem, formulated by \textit{J. W. Demmel} [Linear Algebra Appl. 79, 163--193 (1986; Zbl 0627.65031)], concerning stability of eigendecompositions is solved in a similar way. Here an eigendecomposition of \(A\) is \(A=Xdiag(A_i)X^{-1}\) where \(\Lambda(A_i) \cap \Lambda(A_j) = \emptyset\) for \(i \neq j\).\ Defining the geometric separation of a subset \(\sigma\) of \(\Lambda(A)\), \(gsep(\sigma, A)\) in a similar way it is shown that \(\varepsilon = \min_i gsep(\Lambda(A_i),A)\) is the largest value for which the eigendecomposition is continuous in the set \(\{A': \| A-A'\| \leq \varepsilon\}\). A computational procedure for determining \(d(A)\) is described and some numerical examples are given.
    0 references
    0 references
    eigendecomposition
    0 references
    pseudospectrum
    0 references
    stability
    0 references
    geometrical separation of eigenvalues
    0 references
    multiple eigenvalues
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers