View article

The inverse eigenvalue problem of constructing real and symmetric square matrices M, C, and K of size for the quadratic pencil so that has a prescribed subset of eigenvalues and eigenvectors is considered. This paper consists of two parts addressing two related but different problems.

The first part deals with the inverse problem where M and K are required to be positive definite and semidefinite, respectively. It is shown via construction that the inverse problem is solvable for any k, given complex conjugately closed pairs of distinct eigenvalues and linearly independent eigenvectors, provided . The construction also allows additional optimization conditions to be built into the solution so as to better refine the approximate pencil. The eigenstructure of the resulting is completely analyzed.

The second part deals with the inverse problem where M is a fixed positive definite matrix (and hence may …