A generalized FFT for Clifford algebras
Leopardi, Paul
Bull. Belg. Math. Soc. Simon Stevin, Tome 11 (2005) no. 5, p. 663-688 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
This paper describes a relationship between fast real matrix representations of real universal Clifford algebras and the generalized Fast Fourier Transform for supersolvable groups. Detailed constructions of algorithms for the forward and inverse representations for Clifford algebras are given, with proof that these need at most $O(d \log d)$ operations. The algorithms have been implemented and tested in the GluCat C++ library, and some timing results are included.
Publié le : 2005-03-14
Classification:  Generalized FFT,  Clifford algebras,  real matrix representations,  linear complexity 
@article{1110205626,
     author = {Leopardi, Paul},
     title = {A generalized FFT for Clifford algebras},
     journal = {Bull. Belg. Math. Soc. Simon Stevin},
     volume = {11},
     number = {5},
     year = {2005},
     pages = { 663-688},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1110205626}
}

Leopardi, Paul. A generalized FFT for Clifford algebras. Bull. Belg. Math. Soc. Simon Stevin, Tome 11 (2005) no. 5, pp.  663-688. http://gdmltest.u-ga.fr/item/1110205626/