Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
From MaRDI portal
(Redirected from Publication:734910)
Hermitian matrices whose graphs are trees and which have multiple eigenvalues are considered. In that case matrices associated with some branches in the undirected graph of the matrix have the same eigenvalues. This property and interlacing inequalities are used to construct a numerical enclosure method for multiple eigenvalues.
Recommendations
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
- Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
Cites work
- Computational error bounds for multiple or nearly multiple eigenvalues
- Computer Algebra in Scientific Computing
- Error bounds for computed eigenvalues and eigenvectors
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- Matrix Analysis
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Spectral multiplicity and splitting results for a class of qualitative matrices
- The Parter--Wiener Theorem: Refinement and Generalization
Cited in
(7)- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- scientific article; zbMATH DE number 7373353 (Why is no real title available?)
- Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
- A method for separating nearly multiple eigenvalues for Hermitian matrix
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
This page was built for publication: Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734910)