An algorithm to simplify tensor expressions

From MaRDI portal
Publication:1807987

DOI10.1016/S0010-4655(98)00117-9zbMATH Open1009.53013arXivgr-qc/9803023MaRDI QIDQ1807987FDOQ1807987


Authors: Yanyan Li Edit this on Wikidata


Publication date: 30 November 1999

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

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.


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




Recommendations




Cites Work


Cited In (22)

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)