Document Type : Research Paper
Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran
Department of Mathematics, Faculty of Sciences, Central Tehran branch, Islamic Azad university, Tehran, Iran.
Department of Computer Science, Yazd University, Yazd, Iran.
Inverse eigenvalue problems (IEPs) of tridiagonal matrices are among the most popular IEPs, this is due to the widespread application of this matrix. In this paper, two different IEPs with different eigen information including eigenvalues and eigenvectors are presented on the nonsymmetric tridiagonal matrix. A recursive relation of characteristic polynomials of the leading principal submatrices of the required matrix is presented to solve the problems. The application of the problems in graph and perturbation theory is studied. The necessary and sufficient conditions for solvability of the problems are obtained.
The algorithms and numerical examples are given to show the applicability of the proposed scheme.