Affiliation:
1. University of Shanghai for Science and Technology
Abstract
Symbolic manipulation of indexed polynomials is one of the oldest research topics in computer algebra. Monoterm canonicalization of indexed polynomials is indispensable in finding canonical forms of indexed polynomials. This poster puts forward a symmetric-block distance invariant method and develops a monoterm canonicalization algorithm for Riemann tensor polynomials. The algorithm is implemented in Maple, and shown to be very efficient as the running time is within 15 seconds even when the number of indices is up to 400.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Normalization in Riemann Tensor Polynomial Ring
2. Algorithmic simplification of tensor expressions
3. GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
4. Z. Li S. Shao and W. Liu. Classifications and canonical forms of tensor product expressions in the presence of permutation symmetries. arXiv:1604.06156v1 [physics.chem-ph] Apr. 2016. Z. Li S. Shao and W. Liu. Classifications and canonical forms of tensor product expressions in the presence of permutation symmetries. arXiv:1604.06156v1 [physics.chem-ph] Apr. 2016.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. INVARIANT POLYNOMIALS WITH APPLICATIONS TO QUANTUM COMPUTING;Herald of the Kazakh-British technical university;2024-07-01