xPerm: fast index canonicalization for tensor computer algebra

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...

Title of program: xPerm
Catalogue Id: AEBH_v1_0

Nature of problem
Canonicalization of indexed expressions with respect to permutation symmetries.

Versions of this program held in the CPC repository in Mendeley Data
AEBH_v1_0; xPerm; 10.1016/j.cpc.2008.05.009

This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)

摘要
本文提出了一种针对置换对称性下索引规范化的巴特勒-葡萄牙（Butler–Portugal）算法的超快速实现方案，该实现被命名为xPerm。xPerm由Mathematica软件包与C语言子程序结合开发而成，其中C子程序负责执行计算中最耗时的核心部分，且可被任意其他程序或计算机代数系统调用。本文通过测试与计时实验，验证了巴特勒-葡萄牙算法的近似多项式时间复杂度性能……

程序名称：xPerm
目录标识：AEBH_v1_0

问题属性
针对置换对称性的带索引表达式规范化操作。

存放在孟德莱数据（Mendeley Data）的计算机物理通讯（CPC）程序库中的本程序版本：AEBH_v1_0; xPerm; 10.1016/j.cpc.2008.05.009

本程序源自贝尔法斯特女王大学馆藏的CPC程序库（1969-2019年）

搜集汇总

背景与挑战

背景概述

该数据集涉及xPerm工具，这是一个用于张量计算机代数中索引规范化的快速实现，基于Butler–Portugal算法，通过Mathematica包和C子程序组合而成，专门处理具有置换对称性的索引表达式。