In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the n×n matrix polynomial of arbitrary degree k. Given a set of m eigenpairs (1 m kn), this problem concerns with computing the matrices A i ∈ R n×n for i = 0, 1, 2, . . . , (k − 1) of specified linear structure such that the matrix polynomial P (λ) = λ k I n + k−1 i=0 λ i A i has the given eigenpairs as its eigenvalues and eigenvectors. Many practical applications give rise to the linearly structured structured matrix polynomial. Therefore, construction of the linearly structured matrix polynomial is the most important aspect of the polynomial inverse eigenvalue problem(PIEP). In this paper, a necessary and sufficient condition for the existence of the solution of this problem is derived. Additionally, we characterize the class of all solutions to this problem by giving the explicit expressions of solutions. The results presented in this paper address some important open problems in the area of PIEP raised in De Teran, Dopico and Van Dooren [SIAM Journal on Matrix Analysis and Applications, 36(1) (2015), pp 302 − 328]. An attractive feature of our solution approach is that it does not impose any restriction on the number of eigendata for computing the solution of PIEP. The proposed method is validated with various numerical examples on a spring mass problem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.