An algorithm to simplify tensor expressions

DOI10.1016/S0010-4655(98)00117-9MaRDI QIDQ1807987zbMATH OpenFDO

Authors Yanyan Li

Publication date 30 November 1999

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/gr-qc/9803023

zbMATH Keywords

algorithmcanonicalcanonical formdummy indicesGröbner basissimplificationsymmetrytensortensor symmetry

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to differential geometry (53-04) Methods of local Riemannian geometry (53B21) Computation of special functions and constants, construction of tables (65D20)

Abstract: The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations and the renaming of dummy indices. The tensor indices are split into classes and a natural place for them is defined. The canonical form is the closest configuration to the natural configuration. In the second part, the Groebner basis method is used to simplify tensor expressions which obey the linear identities that come from cyclic symmetries (or more general tensor identities, including non-linear identities). The algorithm is suitable for implementation in general purpose computer algebra systems. Some timings of an experimental implementation over the Riemann package are shown.

Review text

The present paper designs an algorithm for simplifying tensor expressions. One knows that the tensor symmetry and presence of dummy indices make the problem complex. In the first part of this work, the tensor expressions are put into a canonical form taking into account the symmetries with respect to index permutations and the renaming of dummy indices. The definition of the canonical form involves some conventions, which are based on the simplicity of the implementation and on a readable display for tensor expressions. In the second part of this work, the Gröbner basis method is used to address the linear identities coming from cyclic symmetries or more general tensor identities. Some timing of an experimental implementation of the algorithm over the Riemann package are presented.

Recommendations

• Algorithmic simplification of tensor expressions
• Strassen's Algorithm for Tensor Contraction
• scientific article; zbMATH DE number 1273666
• A use of ideal decomposition in the computer algebra of tensor expressions
• The arithmetic complexity of tensor contraction
• Efficient Tensor Decompositions
• A new scheme for the tensor representation
• Decomposition Algorithms for Tensors and Polynomials
• Tensor computations in computer algebra systems

Cites work

• A general backtrack algorithm for the isomorphism problem of combinatorial objects
• Applications of Maple to general relativity
• ATENSOR -- REDUCE program for tensor simplification
• Enumeration of the order-14 invariants formed from the Riemann tensor
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 3483155 (Why is no real title available?)
• scientific article; zbMATH DE number 1254294 (Why is no real title available?)
• scientific article; zbMATH DE number 773929 (Why is no real title available?)
• scientific article; zbMATH DE number 3206737 (Why is no real title available?)
• scientific article; zbMATH DE number 3222940 (Why is no real title available?)
• scientific article; zbMATH DE number 3057922 (Why is no real title available?)
• Normal forms for tensor polynomials. I. The Riemann tensor

Cited in

(26)

• The vectorization expressions of Taylor series multipole-BEM for 3D elasticity problems
• Simplification and normalization of indexed differentials involving coordinate transformation
• Solution of the constraints for tensors generated by iterated integrals
• ATENSOR -- REDUCE program for tensor simplification
• Normalization in Riemann tensor polynomial ring
• Spinorial geometry, off-shell Killing spinor identities and higher derivative 5D supergravities
• The method of colored graphs for simplifying expressions with indices
• Faster tensor canonicalization
• Distance invariant method for normalization of indexed differentials
• \textit{xTras}: a field-theory inspired \textit{xAct} package for Mathematica
• scientific article; zbMATH DE number 1253970 (Why is no real title available?)
• scientific article; zbMATH DE number 1273666 (Why is no real title available?)
• scientific article; zbMATH DE number 2151181 (Why is no real title available?)
• Algorithmic simplification of tensor expressions
• A complete classification of canonical forms of a class of Riemann tensor indexed expressions and its applications in differential geometry
• FeynGrav: FeynCalc extension for gravity amplitudes
• Riemann tensor polynomial canonicalization by graph algebra extension
• New Finsler package
• Combinatorial aspects of simplification of algebraic expressions
• GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
• Strassen's Algorithm for Tensor Contraction
• Ideal decompositions and computation of tensor normal forms
• FeynGrav 2.0
• Restricted Gröbner basis theory for normalization of indexed differential Riemann metric tensor polynomials
• The Canon package: a fast kernel for tensor manipulators
• Cadabra: a field-theory motivated symbolic computer algebra system

Describes a project that uses

Uses Software

• Riegeom
• MapleTensor
• ATENSOR
• Maple
• Ricci
• SHEEP
• MACSYMA
• MathTensor

This page was built for publication: An algorithm to simplify tensor expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807987)