The Faddeev-LeVerrier algorithm

22.11.2021, 16:15  –  Raum 2.9.0.12
Forschungsseminar Differentialgeometrie

Christian Bär

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.