论文信息 - The Parter-Wiener Theorem: Refinement and Generalization

The Parter-Wiener Theorem: Refinement and Generalization

An important theorem about the existence of principal submatrices of a Hermitian matrix whose graph is a tree, in which the multiplicity of an eigenvalue increases, was largely developed in separate papers by Parter and Wiener. Here, the prior work is fully stated, then generalized with a self-contained proof. The more complete result is then used to better understand the eigenvalue possibilities of reducible principal submatrices of Hermitian tridiagonal matrices. Sets of vertices, for which the multiplicity increases, are also studied.

[1] Charles R. Johnson,et al. On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph , 2003 .

[2] Gerry Wiener. Spectral multiplicity and splitting results for a class of qualitative matrices , 1984 .

[3] Charles R. Johnson,et al. On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree , 2002 .

[4] Charles R. Johnson,et al. ON THE MINIMUM NUMBER OF DISTINCT EIGENVALUES FOR A SYMMETRIC MATRIX WHOSE GRAPH IS A GIVEN TREE , 2002 .

[5] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6] Charles R. Johnson,et al. Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix , 2002 .

[7] Charles R. Johnson,et al. The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree , 1999 .

[8] John S. Maybee,et al. Mechanical vibration trees , 1974 .

[9] S. Parter. On the Eigenvalues and Eigenvectors of a Class of Matrices , 1960 .