J. W. Barrett
Publisher: Cambridge University Press
Print Publication Year: 1992
Online Publication Date:December 2009
Chapter DOI: http://dx.doi.org/10.1017/CBO9780511524639.013
Abstract. This article contains some proposals for the construction of an algorithm for the evolution of initial data in general relativity which will apply to generic initial values. One of the main issues is to allow a dynamic refinement of the discretisation which will be local and vary according to local values of the initial data. I outline some of the main problems which will have to be addressed in any implementation of the general scheme. There are also some suggestions for a construction of a smooth solution of the Einstein equations which is near to the discrete evolution.
At the present time, computer codes for general relativity are written specifically for particular problems such as stellar collapse or coalescing binary systems. In the longer run relativists are interested in using the computer as a mathematical tool to investigate the properties of solutions which seem inaccessible by analytic means, or to formulate hypotheses which may then be attacked analytically. This requires the construction of an algorithm which applies to generic initial data and which also has a sufficiently solid framework which allows analytic investigation of the error of the approximation.
The approach I would like to suggest is based on triangulations. One of the problems of numerical relativity is that the degree of discretisation that is required to approximate given data well is dependent on that data. However one cannot predict — in advance — how this will evolve as the data evolves with time.