Another Multivector Inverse Algorithm
Abstract A numerical algorithm is described for computing the inverse of a non-singular multivector across dimensions. The method wraps a reversion-like product around a Faddeev--LeVerrier--Souriau (FLS) polynomial core. While FLS provides dimensional extensibility, the wrapper reduces the polynomial order of the FLS method, and introduces a sparse multivector which can be further exploited. The construction and essential properties of the initial involution are explained. For dimensions 4–7, the optimized inverse requires fewer real multiplications than a same-dimension multivector product. Dimensions 8–11, follow easily on common hardware with similar efficiency. For dimensions 12–15, higher-precision arithmetic demonstrates the generality of the algorithm when the arithmetic can support it. Performance on common hardware is reported. Directions are included for obtaining a Python package with examples for numerical computation in Clifford algebra, supporting arbitrary signatures including degenerate cases.
Authors
- David Arthur Jones (ORCID: https://orcid.org/0009-0009-7693-3396)
Publication Details
- Journal
- Research Square
- Published
- 2026-11-12
- DOI
- https://doi.org/10.21203/rs.3.rs-11536816/v1
- Primary Topic
- Algebraic and Geometric Analysis
- Type
- preprint