Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree (Q734910): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2009.06.038 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997395416 / rank | |||
Normal rank | |||
Revision as of 02:46, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree |
scientific article |
Statements
Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree (English)
0 references
14 October 2009
0 references
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.
0 references
multiple eigenvalues
0 references
Hermitian matrices
0 references
interlacing inequalities
0 references
numerical enclosure method
0 references
