Hyperbolic quadratic matrix polynomials are an important
class of Hermitian matrix polynomials with real eigenvalues, among which the overdamped quadratics
are those with nonpositive eigenvalues. Neither the definition of overdamped nor any of the standard
characterizations provides an efficient way to test if a given has this property. We show that
a quadratically convergent matrix iteration based on cyclic reduction, previously studied by Guo
and Lancaster, provides necessary and sufficient conditions for to be overdamped. For weakly
overdamped the iteration is shown to be generically linearly convergent with constant at worst
1/2, which implies that the convergence of the iteration is reasonably fast in almost all cases of
practical interest. We show that the matrix iteration can be implemented in such a way that when
overdamping is detected a scalar is provided that lies in the gap between the largest and smallest eigenvalues of the quadratic eigenvalue problem (QEP) . Once such a
is known, the QEP can be solved by linearizing to a definite pencil that can be reduced, using
already available Cholesky factorizations, to a standard Hermitian eigenproblem. By incorporating
an initial preprocessing stage that shifts a hyperbolic so that it is overdamped, we obtain an
efficient algorithm that identifies and solves a hyperbolic or overdamped QEP maintaining symmetry
throughout and guaranteeing real computed eigenvalues.