Inverse eigenvalue problems for two special acyclic matrices (Q272125): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: In this paper, we study two inverse eigenvalue problems (IEPs) of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix and one eigenvalue of each of its leading principal submatrices. The second problem involves reconstruction of matrices whose graph is a broom, the eigen data being the maximum and minimum eigenvalues of each of the leading principal submatrices of the required matrix. In order to solve the problems, we use the recurrence relations among leading principal minors and the property of simplicity of the extremal eigenvalues of acyclic matrices. | |||
Property / review text: Summary: In this paper, we study two inverse eigenvalue problems (IEPs) of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix and one eigenvalue of each of its leading principal submatrices. The second problem involves reconstruction of matrices whose graph is a broom, the eigen data being the maximum and minimum eigenvalues of each of the leading principal submatrices of the required matrix. In order to solve the problems, we use the recurrence relations among leading principal minors and the property of simplicity of the extremal eigenvalues of acyclic matrices. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F18 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15B99 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6571023 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
inverse eigenvalue problem | |||
Property / zbMATH Keywords: inverse eigenvalue problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
leading principal minors | |||
Property / zbMATH Keywords: leading principal minors / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph of a matrix | |||
Property / zbMATH Keywords: graph of a matrix / rank | |||
Normal rank |
Revision as of 16:44, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inverse eigenvalue problems for two special acyclic matrices |
scientific article |
Statements
Inverse eigenvalue problems for two special acyclic matrices (English)
0 references
20 April 2016
0 references
Summary: In this paper, we study two inverse eigenvalue problems (IEPs) of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix and one eigenvalue of each of its leading principal submatrices. The second problem involves reconstruction of matrices whose graph is a broom, the eigen data being the maximum and minimum eigenvalues of each of the leading principal submatrices of the required matrix. In order to solve the problems, we use the recurrence relations among leading principal minors and the property of simplicity of the extremal eigenvalues of acyclic matrices.
0 references
inverse eigenvalue problem
0 references
leading principal minors
0 references
graph of a matrix
0 references