Department of Mathematics2024-11-0920150024-379510.1016/j.laa.2014.10.0102-s2.0-84909983076http://dx.doi.org/10.1016/j.laa.2014.10.010https://hdl.handle.net/20.500.14288/13068This work concerns the distance in the 2-norm from a given matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Initially, we consider perturbations of the constant coefficient matrix only. A singular value optimization characterization is derived for the associated distance. We also consider the distance in the general setting, when all of the coefficient matrices are perturbed. In this general setting, we obtain a lower bound in terms of another singular value optimization problem. The singular value optimization problems derived facilitate the numerical computation of the distances.MathematicsApplied mathematicsJournal Article1873-1856347024400029Q25385