Solution of the linearly structured partial polynomial inverse eigenvalue problem

From MaRDI portal



Abstract: In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the nimesn matrix polynomial of arbitrary degree k. Given a set of m eigenpairs (1leqslantmleqslantkn), this problem concerns with computing the matrices AiinmathbbRnimesn for i=0,1,2,ldots,(k−1) of specified linear structure such that the matrix polynomial P(lambda)=lambdakIn+sumi=0k−1lambdaiAi 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.


This paper deals with the linearly structured partial polynomial inverse eigenvalue problem (LPPIEP) for matrices \(A_i \in \mathbb{R}^{n \times n}\), \(i=0,1,\ldots,k-1\) of such that the matrix polynomial \[ P(\lambda)=\lambda^k I_n + \sum_{i=0}^{k-1} \lambda^{i} A_i \] has \(m\) (\(1 \leq m \leq kn\)) prescribed eigenvalues and eigenvectors. Note that the coefficients of \(P(\lambda)\) may have different linear structures. For instance, some of the matrices can be diagonal matrices, other symmetric tridiagonal, etc. In order to address these situations, the authors study another problem, namely: Problem (LPPIEP-I). Given two positive integers \(k\), \(n\) and a set of partial eigenpairs \((\lambda_j, \phi_j)_{j=1}^m\), \(1 \leq m \leq kn\), construct a monic matrix polynomial \(P(\lambda)\) of degree \(k\) in such a way that matrices \(A_i \in\mathcal L_i\), \(i=0,1,\ldots,k-1\) and \(P(\lambda)\) has the specified set \((\lambda_j, \phi_j)_{j=1}^m\), \(1 \leq m \leq kn\) as its eigenpairs. The authors propose an approach for the original LPPIEP. Their results solve some open problems in the theory of polynomial inverse eigenvalue problems. The proposed solution gives an alternative answer to the inverse eigenvalue problems considered in the literature for a specific structure such as symmetric, skew-symmetric, etc. However, in this paper the framework is generalized to an arbitrary linear structure. In particular, for any given specific linear structure, this paper presents a way that systematically generates a system of linear equations and obtain the solution of the corresponding inverse eigenvalue problem. The contributions made in this paper can be summarized as follows: \begin{itemize} \item[(i)] the proposed methods are capable to solve LPPIEP and LPPIEP-I using a set of \(m\), \(1 \leq m \leq kn\), eigenpairs without imposing any restrictions on it; \item[(ii)] it is possible to study the partial inverse eigenvalue problem for different linear structures at once; \item[(iii)] the authors derive some necessary and sufficient conditions on the eigendata for the existence of solution to these problems; \item[(iv)] explicit analytical expressions for the family of matrix polynomials are provided; \item[(v)] sensitivity of the solutions to the perturbations of the eigendata is also discussed; \item[(vi)] the minimum norm solutions of LPPIEP and LPPIEP-I are obtained. \end{itemize}



Cites work









This page was built for publication: Solution of the linearly structured partial polynomial inverse eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2141570)