Faddeev–LeVerrier algorithm
= Faddeev–LeVerrier algorithm
{c}
{wiki}
For $n\times n$ <matrices> over a <field> of <characteristic zero>, or of prime <characteristic> greater than $n$, if
$$
\det(tI-A)=t^n+c_1t^{n-1}+\cdots+c_n,
$$
the Faddeev–LeVerrier algorithm computes the <coefficients> recursively from <matrix trace>[traces] of powers:
$$
c_k=-\frac1k\left(\operatorname{tr}(A^k)+c_1\operatorname{tr}(A^{k-1})+\cdots+c_{k-1}\operatorname{tr}(A)\right).
$$