Distance invariant method for normalization of indexed differentials (Q2229715)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distance invariant method for normalization of indexed differentials |
scientific article |
Statements
Distance invariant method for normalization of indexed differentials (English)
0 references
18 February 2021
0 references
The paper under review is devoted to the problems of symbolic manipulation of indexed expressions (e.g., tensor expressions). The paper introduces a concept of distance from free indices to dummy indices and shows that it is an invariant with respect to certain symmetries. Then the authors present an index replacement algorithm which is uniquely determined by the distance, and use it to develop a normalization algorithm with respect to monoterm symmetries for polynomials in the ring of all partial differential polynomials with Einstein multiplication. The complexity is at most \(O(m^{2})\), lower than known algorithms, where \(m\) is the sum of the number of free indices and the number of pairs of dummy indices. Furthermore, using the method of index replacement, and by choosing the monomial associated with the smallest numerical list as the canonical form, a normalization algorithm is provided for partial differential polynomials with Einstein multiplication of order \(\leq 2\), which is independent of function classifications.
0 references
\(n\)D symbolic computation
0 references
Einstein summation convention
0 references
canonical form
0 references
mechanical theorem proving
0 references
0 references