Note on matrices with a very ill-conditioned eigenproblem
From MaRDI portal
Publication:2557538
DOI10.1007/BF01402528zbMath0252.65027MaRDI QIDQ2557538
Publication date: 1972
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132142
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
On condition numbers and the distance to the nearest ill-posed problem, Nearest linearly structured polynomial matrix with some prescribed distinct eigenvalues, Computing stable eigendecompositions of matrices, On estimating the condition of eigenvalues and eigenvectors, On the distance from a matrix polynomial to matrix polynomials with some prescribed eigenvalues, The geometry of ill-conditioning, How well-conditioned can the eigenvector problem be?, Smoothed analysis of complex conic condition numbers, Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs, Complexity of path-following methods for the eigenvalue problem, Variational Analysis of Approximate Defective Eigenvalues, Distance bounds for prescribed multiple eigenvalues of matrix polynomials, Realistic error bounds for a simple eigenvalue and its associated eigenvector, Computational methods of linear algebra, Nearest matrix with prescribed eigenvalues and its applications, Finite element methods for variational eigenvalue problems, Iterative refinement for defective subspaces of differential operators, On the distance from a matrix polynomial to matrix polynomials with k prescribed distinct eigenvalues, A numerical algorithm for zero counting. III: Randomization and condition, Matrix polynomials with specified eigenvalues, On condition numbers of a nondefective multiple eigenvalue, The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue, The verification of multiplicity support of a defective eigenvalue of a real matrix, Additive preconditioning, eigenspaces, and the inverse iteration, The probability that a slightly perturbed numerical analysis problem is difficult, Stochastic perturbations and smooth condition numbers, Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity, On sensitivity of eigenvalues and eigendecompositions of matrices, On condition numbers of polynomial eigenvalue problems, General formulas for the smoothed analysis of condition numbers, On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue, Pseudospectra, critical points and multiple eigenvalues of matrix polynomials, Sensitivity Analysis of Nonlinear Eigenproblems, The Probability That a Numerical Analysis Problem is Difficult, Compatibility of symplectic structures adapted to noncommutatively integrable systems, On neighbouring matrices with quadratic elementary divisors, Anti-Hadamard matrices, Distance evaluation to the set of matrices with multiple eigenvalues
Cites Work
