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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Another Multivector Inverse Algorithm

David Arthur Jones
Research Square
Algebraic and Geometric Analysis
preprint

Another Multivector Inverse Algorithm

David Arthur Jones
preprint en

Abstract

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.

Research Square
Algebraic and Geometric Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon