Algorithms for computer algebra calculations in spacetime: I. The calculation of curvature
From MaRDI portal
Publication:4894028
Symbolic computation and algebraic computation (68W30) Applications of differential geometry to physics (53Z05) Computational methods for problems pertaining to relativity and gravitational theory (83-08) Software, source code, etc. for problems pertaining to relativity and gravitational theory (83-04)
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.
Recommendations
Cited in
(6)- Computing curvature without Christoffel symbols
- Computing spacetime curvature via differential algebraic equations
- Computer algebra in spacetime embedding
- Algorithms for the explicit computation of Penrose diagrams
- Curvature calculations with spacetime algebra
- An efficient algorithm for the Riemannian 10 j symbols
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)