Computer Science – Symbolic Computation
Scientific paper
2008-03-06
Comp. Phys. Commun. 179 (2008) 597-603
Computer Science
Symbolic Computation
16 pages, 3 figures. Package can be downloaded from http://metric.iem.csic.es/Martin-Garcia/xAct/
Scientific paper
10.1016/j.cpc.2008.05.009
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.
No associations
LandOfFree
xPerm: fast index canonicalization for tensor computer algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with xPerm: fast index canonicalization for tensor computer algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and xPerm: fast index canonicalization for tensor computer algebra will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-13803