Fast matrix representation for Clifford algebras

In this paper, we present two fast matrix representation algorithms based on the recursive decomposition of multivectors into specific right and left ideals. We also examine the relation between these two representations. Furthermore, we derive the explicit forms of the fundamental (anti)automorphisms of these Clifford algebra representations, and the efficient methods to compute them. The algorithms have been implemented in Rust and are available as the Cargo crate clifft on Github, released under the MIT license.