Properties of a matrix with a very ill-conditioned eigenproblem
From MaRDI portal
Publication:2535922
DOI10.1007/BF02165660zbMath0184.37704MaRDI QIDQ2535922
Publication date: 1970
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131973
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 the distance from a matrix polynomial to matrix polynomials with some prescribed eigenvalues, The geometry of ill-conditioning, Perturbation bounds for means of eigenvalues and invariant subspaces, Variational Analysis of Approximate Defective Eigenvalues, Computational methods of linear algebra, Nearest matrix with prescribed eigenvalues and its applications, An algorithm for numerical determination of the structure of a general matrix, On the distance from a matrix polynomial to matrix polynomials with k prescribed distinct eigenvalues, Matrix polynomials with specified eigenvalues, 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, Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity, On sensitivity of eigenvalues and eigendecompositions of matrices, On the construction of nearest defective matrices to a normal matrix, 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, Note on matrices with a very ill-conditioned eigenproblem, Eigenvectors of certain matrices, The Probability That a Numerical Analysis Problem is Difficult, Distance evaluation to the set of matrices with multiple eigenvalues
Cites Work