11 Domain Decomposition

Most three-dimensional codes solving the Einstein equations currently use several non-uniform grids/numerical domains. Adaptive mesh refinement (AMR) à la Berger & Oliger [48], where the computational domain is covered with a set of nested grids, usually taken to be Cartesian ones, is used by many efforts. See, for instance, [386, 338, 394, 277, 160, 24, 393, 38, 84, 109, 430, 442, 439Jump To The Next Citation Point, 157, 321]). Other approaches use multiple patches with curvilinear coordinates, or a combination of both. Typical simulations of Einstein’s equations do not fall into the category of complex geometries and usually require a fairly “simple” domain decomposition (in comparison to fully unstructured approaches in other fields).

Below we give a brief overview of some domain decomposition approaches. Our discussion is far from exhaustive, and only a few representative samples from the rich variety of efforts are mentioned. In the context of Cauchy evolutions, the use of multiple patches in numerical relativity was first advocated and pursued by Thornburg [417, 418].

 11.1 The power and need of adaptivity
 11.2 Adaptive mesh refinement for BBH in higher dimensional gravity
 11.3 Adaptive mesh refinement and curvilinear grids
 11.4 Spectral multi-domain binary black-hole evolutions
 11.5 Multi-domain studies of accretion disks around black holes
 11.6 Finite-difference multi-block orbiting binary black-hole simulations

  Go to previous page Go up Go to next page