xPerm: fast index canonicalization for tensor computer algebra
收藏NIAID Data Ecosystem2026-03-11 收录
下载链接：
https://elsevier.digitalcommonsdata.com/datasets/tgzjp8dhp9
下载链接
链接失效反馈官方服务：
资源简介：
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)
创建时间：
2019-11-11
