We study some aspects of the invariant pair problem for matrix polynomials, as introduced by Betcke and Kressner [3] and by Beyn and Thümmler [6]. Invariant pairs extend the notion of eigenvalue–eigenvector pairs, providing a counterpart of invariant subspaces for the nonlinear case. We compute formulations for the condition numbers and the backward error for invariant pairs and solvents. We then adapt the Sakurai–Sugiura moment method [1] to the computation of invariant pairs, including some classes of problems that have multiple eigenvalues. Numerical refinement via a variant of Newton's method is also studied. Furthermore, we investigate the relation between the matrix solvent problem and the triangularization of matrix polynomials
