vix.ing · top · new · best · stats

xPerm: fast index canonicalization for tensor computer algebra

2008/03/06 by José M. Martín-García, Jose M. Martin-Garcia · 222 citations
Computer Science · Mathematics · Physics and Astronomy · #Algebra over a field #Algorithm #Byte #Computer science #Geometry #Identifier #Linear algebra #Mathematics #Matrix Theory and Algorithms #Permutation (music) #Polynomial #Programming language #Pulsars and Gravitational Waves Research #Pure mathematics #Software #Subalgebra #Subroutine #Symbolic computation #Tensor (intrinsic definition) #Tensor algebra #Tensor decomposition and applications #Unix #cs.SC #gr-qc #hep-th

paper · pdf · doi:10.1016/j.cpc.2008.05.009

published in Computer Physics Communications 179(8), 597-603 (Elsevier BV) · 16 pages, 3 figures. Package can be downloaded from http://metric.iem.csic.es/Martin-Garcia/xAct/

arxiv created 2008/03/06 · openalex publication_date 2008/06/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a combination of a Mathematica package and a C subroutine. The latter performs the most demanding parts of the computations and can be linked from any other program or computer algebra system. We demonstrate with tests and timings the effectively polynomial performance of the Butler-Portugal algorithm with respect to the number of indices, though we also show a case in which it is exponential. Our implementation handles generic tensorial expressions with several dozen indices in hundredths of a second, or one hundred indices in a few seconds, clearly outperforming all other current canonicalizers. The code has been already under intensive testing for several years and has been essential in recent investigations in large-scale tensor computer algebra.

Citations

Cited by

Related