scientific article; zbMATH DE number 3878236
Matrices with a very ill-conditioned eigenvalue problem are studied. Explicit expressions are derived for perturbations that cause subsets of the eigenvalues to coalesce. In simple cases, the smallest possible perturbations are obtained, and it is indicated when those are relevant also in the general case. It is shown that cases with double eigenvalues generally occur for significantly smaller perturbations than cases with a whole group of eigenvalues coalescing. The rather involved paths described by the eigenvalues, when a curve of perturbations, \(A+\eta E\), \(0\leq \eta \leq \epsilon\), is followed, shows that just considering the Puiseux expansion around a multiple eigenvalue, as has been the case in most studies up to now, is not enough. The analysis given here is most significant for those developing software for ill-conditioned eigenvalue problems, giving indications on the questions which can be answered, when one is given a matrix of numbers of a limited precision. The tolerances accepted and bounds given by routines like JNF [cf. \textit{B. Kågström} and the reviewer, ACM Trans. Math. Software 6, 398-419 and 437-443 (1980; Zbl 0434.65020 and Zbl 0434.65021)] may have to be adjusted.
- On condition numbers and the distance to the nearest ill-posed problem
- On estimating the condition of eigenvalues and eigenvectors
- The geometry of ill-conditioning
- An algorithm for the single-input partial pole assignment problem
- Effect of linear perturbation on spectra of matrices
- On the distance from a matrix polynomial to matrix polynomials with some prescribed eigenvalues
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
- On sensitivity of eigenvalues and eigendecompositions of matrices
- On the sensitivity of the spectral projection
- On a theorem of Feingold
- Stability of eigenvalues and spectral decompositions under linear perturbation
- Distance evaluation to the set of matrices with multiple eigenvalues
- The verification of multiplicity support of a defective eigenvalue of a real matrix
- Structured pseudospectra and structured sensitivity of eigenvalues
- On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
- Sensitivity and computation of a defective eigenvalue
- scientific article; zbMATH DE number 3988607 (Why is no real title available?)
- scientific article; zbMATH DE number 4034986 (Why is no real title available?)
- The Probability That a Numerical Analysis Problem is Difficult
- Berechnung der Parameterempfindlichkeiten der Eigenwerte aus der Resolvente einer Matrix
- Numerical Rank Deficiency in Matrix Products
- Sensitivity analysis of nonlinear eigenproblems
- Characterization and construction of the nearest defective matrix via coalescence of pseudospectral components
- The calculation of the distance to a nearby defective matrix.
- Nearest linearly structured polynomial matrix with some prescribed distinct eigenvalues
- Variational Analysis of Approximate Defective Eigenvalues
- The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix
- On the Distance to the Nearest Defective Matrix
- Solving matrix nearness problems via Hamiltonian systems, matrix factorization, and optimization
- On nearest matrix with partially specified eigen-structure
- Noise sensitivity of the top eigenvector of a Wigner matrix
- Nearest matrix with prescribed eigenvalues and its applications
- The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
- Pseudospectra, critical points and multiple eigenvalues of matrix polynomials
- Nearest southeast submatrix that makes multiple a prescribed eigenvalue.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343313)