Characteristic Polynomials in Clifford Algebras and in More General Algebras
- 35 Downloads
This article combines two independent theories: firstly, the algorithm of Faddeev–Leverrier which calculates characteristic polynomials of matrices; secondly, the Descent Theory which, in particular, lets many properties of matrix algebras descend down to Azumaya algebras, especially the characteristic polynomials. The algorithm of Faddeev–Leverrier is completely revisited. The details of the descent are explained as far as they are needed for Clifford algebras over fields.
KeywordsMatrices Algorithm of Faddeev–Leverrier Central simple algebras Azumaya algebras
Mathematics Subject Classification15A15 16S50 15A66
- 4.Knus, M.A.: Quadratic and Hermitian Forms Over Rings, Grundlehren der Math. Wissenschaft, vol. 294. Springer, Berlin (1991)Google Scholar
- 6.Parisse, B.: Algorithmes de calcul formel et numérique. https://www-fourier.ujf-grenoble.fr/~parisse/algo.html#sec243 Institut Fourier, Université de Grenoble (2018)