The inverse eigenvalue problem of constructing square matrices M,C and K of size n for the quadratic pencil Q(λ) ≡ λM + λC +K so that Q(λ) has a prescribed subset of eigenvalues and eigenvectors is considered. This paper offers a constructive proof showing that, given any k ≤ n distinct eigenvalues and linearly independent eigenvectors, the problem is solvable even under the restriction that M,...