Choosing a smart set of coordinates is not the end of the story. As for finite elements, one would like to be
able to cover some complicated geometries, like distorted stars, tori, etc…or even to be able to cover the
whole space. The reason for this last point is that, in numerical relativity, one often deals with isolated
systems for which boundary conditions are only known at spatial infinity. A quite simple choice is to
perform a mapping from numerical coordinates to physical coordinates, generalizing the change of
coordinates to , when using families of orthonormal polynomials or to
for Fourier
series.
An example of how to map the domain can be taken from Canuto et al. [56
], and is
illustrated in Figure 17
: once the mappings from the four sides (boundaries) of
to the four sides of
are known, one can construct a two-dimensional regular mapping
, which preserves orthogonality and
simple operators (see Chapter 3.5 of [56
]).
The case where the boundaries of the considered domain are not known at the beginning of the
computation can also be treated in a spectral way. In the case where this surface corresponds to the surface
of a neutron star, two approaches have been used. First, in Bonazzola et al. [38], the star (and therefore
the domain) is supposed to be “star-like”, meaning that there exists a point from which it is possible to
reach any point on the surface by straight lines that are all contained inside the star. To such a point is
associated the origin of a spherical system of coordinates, so that it is a spherical domain, which is regularly
deformed to coincide with the shape of the star. This is done within an iterative scheme, at every step, once
the position of the surface has been determined. Then, another approach has been developed by
Ansorg et al. [10
] using cylindrical coordinates. It is a square in the plane
, which is
mapped onto the domain describing the interior of the star. This mapping involves an unknown
function, which is itself decomposed in terms of a basis of Chebyshev polynomials, so that its
coefficients are part of the global vector of unknowns (as the density and gravitational field
coefficients).
In the case of black-hole–binary systems, Scheel et al. [189] have developed horizon-tracking
coordinates using results from control theory. They define a control parameter as the relative drift of the
black hole position, and they design a feedback control system with the requirement that the adjustment
they make on the coordinates be sufficiently smooth that they do not spoil the overall Einstein solver. In
addition, they use a dual-coordinate approach, so that they can construct a comoving coordinate map,
which tracks both orbital and radial motion of the black holes and allows them to successfully evolve the
binary. The evolutions simulated in [189
] are found to be unstable, when using a single rotating-coordinate
frame. We note here as well the work of Bonazzola et al. [42], where another option is explored: the
stroboscopic technique of matching between an inner rotating domain and an outer inertial
one.
As stated above, the mappings can also be used to include spatial infinity into the computational domain.
Such a compactification technique is not tied to spectral methods and has already been used with
finite-difference methods in numerical relativity by, e.g., Pretorius [177]. However, due to the relatively low
number of degrees of freedom necessary to describe a spatial domain within spectral methods, it is easier
within this framework to use some resources to describe spatial infinity and its neighborhood. Many choices
are possible to do so, either directly choosing a family of well-behaved functions on an unbounded interval,
for example the Hermite functions (see, e.g., Section 17.4 in Boyd [48
]), or making use of standard
polynomial families, but with an adapted mapping. A first example within numerical relativity
was given by Bonazzola et al. [41
] with the simple inverse mapping in spherical coordinates.
The multidomain (or multipatch) technique has been presented in Section 2.6 for one spatial dimension. In
Bonazzola et al. [40] and Grandclément et al. [109
], the three-dimensional spatial domains consist of
spheres (or star-shaped regions) and spherical shells, across which the solution can be matched as in
one-dimensional problems (only through the radial dependence). In general, when performing a matching in
two or three spatial dimensions, the reconstruction of the global solution across all domains might need
some more care to clearly write down the matching conditions (see, e.g., [168
], where overlapping as well as
nonoverlapping domains are used at the same time). For example in two dimensions, one of the problems
that might arise is the counting of matching conditions for corners of rectangular domains, when
such a corner is shared among more than three domains. In the case of a PDE where matching
conditions must be imposed on the value of the solution, as well as on its normal derivative
(Poisson or wave equation), it is sufficient to impose continuity of either normal derivative at
the corner, the jump in the other normal derivative being spectrally small (see Chapter 13 of
Canuto et al. [56
]).
A now typical problem in numerical relativity is the study of binary systems (see also Sections 5.5 and
6.3) for which two sets of spherical shells have been used by Gourgoulhon et al. [100], as displayed in
Figure 18
. Different approaches have been proposed by Kidder et al. [128
], and used by Pfeiffer [168
] and
Scheel et al. [189
] where spherical shells and rectangular boxes are combined together to form a grid
adapted to black hole binary study. Even more sophisticated setups to model fluid flows in complicated
tubes can be found in [144].
Multiple domains can thus be used to adapt the numerical grid to the interesting part (manifold) of the
coordinate space; they can be seen as a technique close to the spectral element method [167]. Moreover, it
is also a way to increase spatial resolution in some parts of the computational domain where one expects
strong gradients to occur: adding a small domain with many degrees of freedom is the analog of fixed-mesh
refinement for finite-differences.
http://www.livingreviews.org/lrr-2009-1 | ![]() This work is licensed under a Creative Commons License. Problems/comments to |