Perturbation bounds for means of eigenvalues and invariant subspaces
From MaRDI portal
Publication:5610051
DOI10.1007/BF01934203zbMath0208.18302MaRDI QIDQ5610051
Publication date: 1970
Published in: BIT (Search for Journal in Brave)
Related Items
Log-majorization Type Inequalities, Sensitivity and Computation of a Defective Eigenvalue, Solving eigenvalue PDEs of metastable diffusion processes using artificial neural networks, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Perturbation bounds in connection with singular value decomposition, Computational methods of linear algebra, Communicability cosine distance: similarity and symmetry in graphs/networks, An algorithm for numerical determination of the structure of a general matrix, Extensions of \(tr[(A^{-1}-B^{-1})(A-B)\leq 0\) for covariance matrices A, B], Majorization between the diagonal elements and the eigenvalues of an oscillating matrix, Applications of the asymmetric eigenvalue problem techniques to robust testing, Optimization of generalized mean square error in signal processing and communication, Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices, The numerical Jordan form, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, Oscillation results for selfadjoint differential systems
Cites Work
- Unnamed Item
- Unnamed Item
- Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
- On smallest isolated Gerschgorin disks for eigenvalues. III
- Singular value decomposition and least squares solutions
- Properties of a matrix with a very ill-conditioned eigenproblem
- New Root-Location Theorems for Partitioned Matrices
- Computing Invariant Subspaces of a General Matrix when the Eigensystem is Poorly Conditioned
- An algorithm for numerical determination of the structure of a general matrix
- On the Singular Values of a Product of Completely Continuous Operators
