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

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.

Authors

Publication Details

Journal
DOAJ (DOAJ: Directory of Open Access Journals)
Published
2026-09-01
DOI
https://doi.org/10.22067/ijnao.2026.96651.1785
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Maryam Babaei Zarch
DOAJ (DOAJ: Directory of Open Access Journals)
Matrix Theory and Algorithms
article

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

Maryam Babaei Zarch
article en

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.

DOAJ (DOAJ: Directory of Open Access Journals)
Openalex Percentile: Top 7%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.