Inverse Eigenvalue Problems for Two Special Acyclic Matrices
AbstractIn 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Sharma, D.; Sen, M. Inverse Eigenvalue Problems for Two Special Acyclic Matrices. Mathematics 2016, 4, 12.
Sharma D, Sen M. Inverse Eigenvalue Problems for Two Special Acyclic Matrices. Mathematics. 2016; 4(1):12.Chicago/Turabian Style
Sharma, Debashish; Sen, Mausumi. 2016. "Inverse Eigenvalue Problems for Two Special Acyclic Matrices." Mathematics 4, no. 1: 12.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.