Algorithms for computer algebra calculations in spacetime: I. The calculation of curvature

From MaRDI portal
Publication:4894028

DOI10.1088/0264-9381/13/8/021zbMATH Open0859.53057arXivgr-qc/9601036OpenAlexW1564679825MaRDI QIDQ4894028FDOQ4894028


Authors: D. Pollney, Peter Musgrave, Kevin Santosuosso, Kayll Lake Edit this on Wikidata


Publication date: 13 November 1996

Published in: Classical and Quantum Gravity (Search for Journal in Brave)

Abstract: We examine the relative performance of algorithms for the calculation of curvature in spacetime. The classical coordinate component method is compared to two distinct versions of the Newman-Penrose tetrad approach for a variety of spacetimes, and distinct coordinates and tetrads for a given spacetime. Within the system GRTensorII, we find that there is no single preferred approach on the basis of speed. Rather, we find that the fastest algorithm is the one that minimizes the amount of time spent on simplification. This means that arguments concerning the theoretical superiority of an algorithm need not translate into superior performance when applied to a specific spacetime calculation. In all cases it is the global simplification strategy which is of paramount importance. An appropriate simplification strategy can change an untractable problem into one which can be solved essentially instantaneously.


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




Recommendations





Cited In (5)

Uses Software





This page was built for publication: Algorithms for computer algebra calculations in spacetime: I. The calculation of curvature

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894028)