Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree

DOI10.1016/j.laa.2009.06.038zbMath1183.65038MaRDI QIDQ734910

Kenji Toyonaga

Publication date: 14 October 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.06.038

zbMATH Keywords

Hermitian matrices; interlacing inequalities; multiple eigenvalues; numerical enclosure method

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A42: Inequalities involving eigenvalues and eigenvectors

15B57: Hermitian, skew-Hermitian, and related matrices

Related Items

Unnamed Item

Uses Software

• Matlab
• INTLAB

Cites Work

• Unnamed Item
• Spectral multiplicity and splitting results for a class of qualitative matrices
• Error bounds for computed eigenvalues and eigenvectors
• 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
• Matrix Analysis
• The Parter--Wiener Theorem: Refinement and Generalization
• Computer Algebra in Scientific Computing
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• Computational error bounds for multiple or nearly multiple eigenvalues