On the inverse eigenvalue problem for a specific symmetric matrix

Document Type : Research Article

Author

Faculty of Mathematical Sciences, Vali-e-Asr University of Rafsanjan, Rafsanjan, Kerman, Iran

Abstract

The aim of the current paper is to study a partially described inverse eigenvalue problem of  a specific symmetric  matrix, and prove some properties of such matrix. The problem includes the construction of the matrix by  the  minimal eigenvalue of all  leading principal submatrices  and eigenpair $(\lambda_2^{(n)},x)$ such that $ \lambda_2^{(n)}$ is the maximal eigenvalue of the required matrix. We investigate  conditions for the solvability of the problem, and finally an algorithm and  its numerical results are presented.

Keywords

Main Subjects

References

[1] M. T. Chu, H.Golub, Inverse Eigenvalue Problems: Theory, Algorithms, and Applications, Numeri-
cal mathematics and Scientific Computation Oxford University Press, New York (2005).
[2] D. Sharma and M. Sen, The minimax inverse eigenvalue problem for matrices whose graph is a
generalized star of depth 2, Linear Algebra Appl, 621 (2021) 334–344.
[3] D. Sharma and B. Sarma, Extremal inverse eigenvalue problem for irreducible acyclic matrices,
Applied Mathematics in Science and Engineering. 30 (2022) 192–209.
[4] M. Babaei, S.A. Shahzadeh Fazeli, S.M. Karbassi, Inverse eigenvalue problem for constructing a
kind of acyclic matrices with two eigenpairs, Appl Math. 65 (2020) 89–103.
[5] H. Pickmann, J. Egana, R.L. Soto, Extremal inverse eigenvalue problem for bordered diagonal ma-
trices. Linear Algebra Appl. 427 (2007) 256–271.
[6] L. Hogben, Spectral graph theory and the inverse eigenvalue problem of a graph. Electron. J. Linear
Algebra. 14 (2005) 12–31.
Journal of Mathematical Modeling
Volume 11, Issue 3
October 2023
Pages 479-489

Files

Share

How to cite

Statistics