An algorithm to simplify tensor expressions
From MaRDI portal
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.
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
- 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?)
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- ATENSOR -- REDUCE program for tensor simplification
- Applications of Maple to general relativity
- Enumeration of the order-14 invariants formed from the Riemann tensor
- Normal forms for tensor polynomials. I. The Riemann tensor
Cited in
(23)- Distance invariant method for normalization of indexed differentials
- The method of colored graphs for simplifying expressions with indices
- scientific article; zbMATH DE number 1273666 (Why is no real title available?)
- \textit{xTras}: a field-theory inspired \textit{xAct} package for Mathematica
- Combinatorial aspects of simplification of algebraic expressions
- Normalization in Riemann tensor polynomial ring
- Cadabra: a field-theory motivated symbolic computer algebra system
- Solution of the constraints for tensors generated by iterated integrals
- Riemann tensor polynomial canonicalization by graph algebra extension
- The vectorization expressions of Taylor series multipole-BEM for 3D elasticity problems
- Strassen's Algorithm for Tensor Contraction
- Spinorial geometry, off-shell Killing spinor identities and higher derivative 5D supergravities
- FeynGrav: FeynCalc extension for gravity amplitudes
- Algorithmic simplification of tensor expressions
- scientific article; zbMATH DE number 2151181 (Why is no real title available?)
- GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
- New Finsler package
- The Canon package: a fast kernel for tensor manipulators
- Simplification and normalization of indexed differentials involving coordinate transformation
- Ideal decompositions and computation of tensor normal forms
- ATENSOR -- REDUCE program for tensor simplification
- FeynGrav 2.0
- A complete classification of canonical forms of a class of Riemann tensor indexed expressions and its applications in differential geometry
Describes a project that uses
Uses Software
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)
