The Faddeev-LeVerrier algorithm is an algorithm for the computation of the characteristic polynomial of a square matrix. It is slower than Gauss elimination but in contrast to the former it is division-free and works for matrices with coefficients in any $$\mathbb{Q}$$-algebra. On the other hand, it is much faster than naive algorithms.