TY  - JOUR
A1  - Bär, Christian
T1  - The Faddeev-LeVerrier algorithm and the Pfaffian
JF  - Linear algebra and its applications
N2  - We adapt the Faddeev-LeVerrier algorithm for the computation of characteristic polynomials to the computation of the Pfaffian of a skew-symmetric matrix. This yields a very simple, easy to implement and parallelize algorithm of computational cost O(n(beta+1)) where nis the size of the matrix and O(n(beta)) is the cost of multiplying n x n-matrices, beta is an element of [2, 2.37286). We compare its performance to that of other algorithms and show how it can be used to compute the Euler form of a Riemannian manifold using computer algebra.
KW  - Characteristic polynomial
KW  - Determinant
KW  - Pfaffian
KW  - Gauss-Bonnet-Chern
KW  - theorem
Y1  - 2021
U6  - https://doi.org/10.1016/j.laa.2021.07.023
SN  - 0024-3795
SN  - 1873-1856
VL  - 630
SP  - 39
EP  - 55
PB  - Elsevier
CY  - New York
ER  -