REVIEW 1 cited by
ATENSOR - REDUCE program for tensor simplification
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The paper presents a REDUCE program for the simplification of tensor expressions that are considered as formal indexed objects. The proposed algorithm is based on the consideration of tensor expressions as vectors in some linear space. This linear space is formed by all the elements of the group algebra of the corresponding tensor expression. Such approach permits us to simplify the tensor expressions possessing symmetry properties, summation (dummy) indices and multiterm identities by unify manner. The canonical element for the tensor expression is defined in terms of the basic vectors of this linear space. The main restriction of the algorithm is the dimension of the linear space that is equal to N!, where N is a number of indices of the tensor expression. The program uses REDUCE as user interface.
Forward citations
Cited by 1 Pith paper
-
Using SimTeEx to simplify polynomial expressions with tensors
SimTeEx simplifies tensor polynomials with arbitrary symmetry relations by combining graph-based handling of dummy indices with reduced row echelon form linear algebra.
Discussion (0). Continue with ORCID to comment.