Bulletin of the Belgian Mathematical Society - Simon Stevin
- Bull. Belg. Math. Soc. Simon Stevin
- Volume 11, Number 5 (2005), 663-688.
A generalized FFT for Clifford algebras
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.
Bull. Belg. Math. Soc. Simon Stevin Volume 11, Number 5 (2005), 663-688.
First available in Project Euclid: 7 March 2005
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Leopardi, Paul. A generalized FFT for Clifford algebras. Bull. Belg. Math. Soc. Simon Stevin 11 (2005), no. 5, 663--688.https://projecteuclid.org/euclid.bbms/1110205626