Abstract

Many evolution problems in physics are described by partial differential equations on an infinite domain; therefore, one is interested in the solutions to such problems for a given initial dataset. A prominent example is the binary black-hole problem within Einstein’s theory of gravitation, in which one computes the gravitational radiation emitted from the inspiral of the two black holes, merger and ringdown. Powerful mathematical tools can be used to establish qualitative statements about the solutions, such as their existence, uniqueness, continuous dependence on the initial data, or their asymptotic behavior over large time scales. However, one is often interested in computing the solution itself, and unless the partial differential equation is very simple, or the initial data possesses a high degree of symmetry, this computation requires approximation by numerical discretization. When solving such discrete problems on a machine, one is faced with a finite limit to computational resources, which leads to the replacement of the infinite continuum domain with a finite computer grid. This, in turn, leads to a discrete initial-boundary value problem. The hope is to recover, with high accuracy, the exact solution in the limit where the grid spacing converges to zero with the boundary being pushed to infinity.The goal of this article is to review some of the theory necessary to understand the continuum and discrete initial boundary-value problems arising from hyperbolic partial differential equations and to discuss its applications to numerical relativity; in particular, we present well-posed initial and initial-boundary value formulations of Einstein’s equations, and we discuss multi-domain high-order finite difference and spectral methods to solve them.

Highlights

  • This review discusses fundamental tools from the analytical and numerical theory underlying the Einstein field equations as an evolution problem on a finite computational domain

  • Emphasis is placed on setting up the initial-boundary value problem (IBVP) for Einstein’s equations properly, by which we mean obtaining a well-posed formulation, which is flexible enough to incorporate coordinate conditions, which allow for long-term and accurate stable numerical evolutions

  • We generalize the theory one more step and consider evolution systems, which are described by quasilinear partial differential equations, that is, by nonlinear partial differential equations, which are linear in their highest-order derivatives

Read more

Summary

Introduction

This review discusses fundamental tools from the analytical and numerical theory underlying the Einstein field equations as an evolution problem on a finite computational domain. Olivier Sarbach and Manuel Tiglio analyzing well-posedness of the IBVP For this reason, the theory of IBVP for hyperbolic problems is reviewed, followed by a presentation of the state of the art of boundary conditions for the harmonic and BSSN formulations of Einstein’s equations, where open problems related with gauge uniqueness are described. We refer the reader to [126] for a recent book on general relativity and the Einstein equations, which, among many other topics, discusses local and global aspects of the Cauchy problem, the constraint equations, and self-gravitating matter fields such as relativistic fluids and the relativistic kinetic theory of gases.

Notation and Conventions
The Initial-Value Problem
Well-posedness
Extension of solutions
Algebraic characterization
First-order systems
Second-order systems
Linear problems with variable coefficients
The localization principle
Characteristic speeds and fields
Energy estimates and finite speed of propagation
Quasilinear equations
The principle of linearization
Abstract evolution operators
Initial-Value Formulations for Einstein’s Equations
The harmonic formulation
Hyperbolicity
Constraint propagation and damping
Geometric issues
The ADM formulation
Algebraic gauge conditions
Dynamical gauge conditions leading to a well-posed formulation
Elliptic gauge conditions leading to a well-posed formulation
Constraint propagation
The BSSN formulation
The hyperbolicity of the BSSN evolution equations
Other hyperbolic formulations
Boundary Conditions
The Laplace method
Necessary conditions for well-posedness and the Lopatinsky condition
Sufficient conditions for well-posedness and boundary stability
Maximal dissipative boundary conditions
Application to systems of wave equations
Existence of weak solutions and the adjoint problem
Absorbing boundary conditions
The one-dimensional wave equation
The three-dimensional wave equation
The wave equation on a curved background
Well-posedness of the IBVP
Boundary conditions for BSSN
Geometric existence and uniqueness
Geometric existence and uniqueness in the linearized case
Alternative approaches
Numerical Stability
Definitions and examples
The von Neumann condition
The method of lines
Semi-discrete stability
Fully-discrete stability
Strict or time-stability
Runge–Kutta methods
Embedded methods
Remarks
Spatial Approximations
Polynomial interpolation
Finite differences through interpolation
Summation by parts
Stability
Numerical dissipation
Going further
Spectral Methods
Periodic functions
Singular Sturm–Liouville problems
Some properties of orthogonal polynomials
Legendre and Chebyshev polynomials
Legendre
Chebyshev
The minmax property of Chebyshev points
Gauss quadratures and summation by parts
Discrete expansions and interpolation
Spectral collocation differentiation
The collocation approach
10 Numerical Boundary Conditions
10.1.1 Injection
10.1.2 Projections
10.1.3 Penalty conditions
10.2 Interface boundary conditions
10.2.1 Penalty conditions
10.3.1 Absorbing boundary conditions
11 Domain Decomposition
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
12 Acknowledgements
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call