[math-fun] Algorithm for matrix 'companionization'

Given a square matrix M (over the integers, e.g.), is there a standard algorithm for 'companionization' -- i.e., rational reduction to companion matrix form? Clearly, the initial and final states are representable, because p(x)=|M-xI|, so I would imagine that such a procedure is possible, but I've never encountered it.