Linear-time algorithm for verifying the copositivity of an acyclic matrix

A real symmetric matrix A is said to be copositive if (Ax, x) ≥ 0 for every vector x with non-negative components. In a recent publication, Bomze proposed a linear-time algorithm for verifying the copositivity of a tridiagonal matrix. It is shown that this algorithm can be extended to the case of an arbitrary acyclic matrix.