Inverse Eigenvalue Problem for a Kind of Acyclic Matrices

被引：3

作者：

Zarch, M. Babaei ^{[1
]}

Fazeli, S. A. Shahzadeh ^{[1
,2
]}

机构：

[1] Yazd Univ, Dept Math Sci, Yazd, Iran

[2] Yazd Univ, Parallel Proc Lab, Yazd, Iran

来源：

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE | 2019年 / 43卷 / A5期

关键词：

Inverse eigenvalue problem; Double starlike tree; Leading principal submatrices; Graph of a matrix; Eigenvalue; GRAPH;

D O I：

10.1007/s40995-019-00737-x

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

In this paper, we study an inverse eigenvalue problem for reconstruction of matrices whose graph is a double starlike tree. This is performed by using the minimal and maximal eigenvalues of all leading principal submatrices of the required matrix. The usual process of solving the problem involves the use of recurrence relations among the characteristic polynomials of the leading principal submatrices of lambda I-A where A is the required matrix. We investigate the necessary and sufficient conditions for the solvability of the problem. Finally, we provide an algorithm to construct the matrix.

引用

页码：2531 / 2539

页数：9

共 9 条

[1]

[Anonymous], 2005, INVERSE EIGENVALUE P

[2]

Babaei Zarch M., 2018, J ALGORITHMS COMPUT, V50, P89

[3] On the inverse eigenvalue problem for a special kind of acyclic matrices [J].