In this paper, we address the extremal inverse eigenvalue problem for pentadiagonal matrices. We provide sufficient conditions for their existence and realizability through new constructions that consider spectral data of its leading principal submatrices. Finally, we present some examples generated from the algorithmic procedures derived from our results.
In this paper, we give sufficient conditions for the construction of certain symmetric and nonsymmetric pentadiagonal matrices from particular spectral information. The construction of the symmetric pentadiagonal matrix considers the extreme eigenvalues of its leading principal submatrices and a prescribed entry, and the construction of the nonsymmetric pentadiagonal matrix also considers an eigenvector and two prescribed entries.