Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Berlin (1993)
Gantmacher, F.R.: Théorie des matrices, Tome 1. Dunod, Paris (1966)
Helmstetter, J., Micali, A.: Quadratic Mappings and Clifford Algebras. Birk-häuser, Basel (2008)
Knus, M.A.: Quadratic and Hermitian Forms Over Rings, Grundlehren der Math. Wissenschaft, vol. 294. Springer, Berlin (1991)
Knus, M.A., Ojanguren, M.: Théorie de la Descente et Algèbres d’Azumaya. Lecture Notes in Math, vol. 389. Springer, Berlin (1974)
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)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This article is part of the Topical Collection on Homage to Prof. W.A. Rodrigues Jr. edited by Jayme Vaz Jr..
Rights and permissions
About this article
Cite this article
Helmstetter, J. Characteristic Polynomials in Clifford Algebras and in More General Algebras. Adv. Appl. Clifford Algebras 29, 30 (2019). https://doi.org/10.1007/s00006-019-0944-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00006-019-0944-5