Inverse eigenvalue problems for composite banded tridiagonal matrices: symmetric and nonsymmetric cases

Document Type : Research Article

Author

Maryam Babaei Zarch

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

10.22067/ijnao.2026.96651.1785

Abstract

We study an inverse eigenvalue problem associated with a special class of structured matrices in both symmetric and nonsymmetric forms. In the symmetric case, the problem involves two sets of eigenpairs corresponding to the original matrix and its leading principal submatrix of order $n-1$. For the nonsymmetric case, the minimum and maximum eigenvalues of each leading principal submatrix, together with an eigenpair associated with the maximum eigenvalue of the original matrix, are prescribed. By establishing recurrence relations between successive principal submatrices, we derive the necessary and sufficient conditions for the solvability of the problems. Moreover, explicit reconstruction algorithms are developed, and several numerical results are presented to illustrate the effectiveness of the proposed methods.

Keywords

Eigenvalue

Eigenpair

Leading principal submatrices

Inverse eigenvalue problem

Subjects

• Numerical linear algebra and its applications

---

References

[1] Arela-Pérez, S., Egaña, J., Pasten, G. and Pickmann-Soto, H., Extremal realization spectra
by two acyclic matrices whose graphs are caterpillars, Linear Multilinear Algebra, 71(10)
(2022), 1657–1680.

[2] Arela-Pérez, S., Lozano, C., Nina, H., Pickmann-Soto, H. and Rodriguez, J., The new
inverse eigenvalue problems for periodic and generalized periodic Jacobi matrices from their
extremal spectral data, Linear Algebra Appl. 659 (2023), 55–72.
[3] Chen, G.-L. and Xu, W.-R., On inverse eigenvalue problems for two kinds of special banded
matrices, Filomat, 31(2) (2017), 371–385.
[4] Chu, M. T. and Golub, H., Inverse eigenvalue problems: Theory, algorithms, and applica-
tions, Numerical Mathematics and Scientific Computation, Oxford University Press, New
York, 2005.
[5] Higgins, V. and Johnson, C., Inverse spectral problems for collections of leading principal
submatrices of tridiagonal matrices, Linear Algebra Appl. 489 (2016), 104–122.
[6] Hogben, L., Spectral graph theory and the inverse eigenvalue problem of a graph, Electron.
J. Linear Algebra 14 (2005), 12–31.
[7] Pickmann, H., Arela, S., Egaña, J. and Carrasco, D., On the inverse eigenproblem for
symmetric and nonsymmetric arrowhead matrices, Proyecciones, 38 (2019), 811–828.
[8] Pickmann, H., Egana, J., Soto, R.L., Extremal inverse eigenvalue problem for bordered
diagonal matrices, Linear Algebra Appl. 427 (2007), 256–271.
[9] Pickmann, H., Egaña, J. and Soto, R.L., Extreme spectra realization by real symmetric
tridiagonal and real symmetric arrow matrices,Electron. J. Linear Algebra, 22 (2011), 780–
795.
[10] Sharma, D. and Sarma, B., Extremal inverse eigenvalue problem for irreducible acyclic
matrices, Appl. Math. Sci. Eng. 30 (2022), 192–209.
[11] Sharma, D. and Sen, M., The minimax inverse eigenvalue problem for matrices whose graph
is a generalized star of depth 2, Linear Algebra Appl. 621 (2021), 334–344.