IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1106-d1622159.html
   My bibliography  Save this article

Computation of Minimal Polynomials and Multivector Inverses in Non-Degenerate Clifford Algebras

Author

Listed:
  • Dimiter Prodanov

    (PAML-LN, Institute for Information and Communication Technologies (IICT), Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
    Neuroelectronics Research Flanders, IMEC, 3001 Leuven, Belgium)

Abstract

Clifford algebras are an active area of mathematical research having numerous applications in mathematical physics and computer graphics, among many others. This paper demonstrates algorithms for the computation of characteristic polynomials, inverses, and minimal polynomials of general multivectors residing in a non-degenerate Clifford algebra of an arbitrary dimension. The characteristic polynomial and inverse computation are achieved by a translation of the classical Faddeev–LeVerrier–Souriau (FVS) algorithm in the language of Clifford algebra. The demonstrated algorithms are implemented in the Clifford package of the open source computer algebra system Maxima. Symbolic and numerical examples residing in different Clifford algebras are presented.

Suggested Citation

  • Dimiter Prodanov, 2025. "Computation of Minimal Polynomials and Multivector Inverses in Non-Degenerate Clifford Algebras," Mathematics, MDPI, vol. 13(7), pages 1-26, March.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1106-:d:1622159
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1106/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/7/1106/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1106-:d:1622159. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.