An Algorithm to Simplify Tensor Expressions

Astronomy and Astrophysics – Astrophysics – General Relativity and Quantum Cosmology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, Latex2e, submitted to Computer Physics Communications: Thematic Issue on "Computer Algebra in Physics Research"

Scientific paper

10.1016/S0010-4655(98)00117-9

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Algorithm to Simplify Tensor Expressions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algorithm to Simplify Tensor Expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm to Simplify Tensor Expressions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-679611

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.