03.07.2025, 16:15
– Raum 1.22
Forschungsseminar Differentialgeometrie
Heat and resolvent expansions in the noncommutative case
Matthias Lesch (Bonn)
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.