Abstract
We present a modification to the Berger and Oliger adaptive mesh refinement algorithm designed to solve systems of coupled, non-linear, hyperbolic and elliptic partial differential equations. Such systems typically arise during constrained evolution of the field equations of general relativity. The novel aspect of this algorithm is a technique of "extrapolation and delayed solution" used to deal with the non-local nature of the solution of the elliptic equations, driven by dynamical sources, within the usual Berger and Oliger time-stepping framework. We show empirical results demonstrating the effectiveness of this technique in axisymmetric gravitational collapse simulations, and further demonstrate that the solution time scales approximately linearly with problem size. We also describe several other details of the code, including truncation error estimation using a self-shadow hierarchy, and the refinement-boundary interpolation operators that are used to help suppress spurious high-frequency solution components ("noise").
Original language | English (US) |
---|---|
Pages (from-to) | 246-274 |
Number of pages | 29 |
Journal | Journal of Computational Physics |
Volume | 218 |
Issue number | 1 |
DOIs | |
State | Published - Oct 10 2006 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Numerical Analysis
- Modeling and Simulation
- Physics and Astronomy (miscellaneous)
- General Physics and Astronomy
- Computer Science Applications
- Computational Mathematics
- Applied Mathematics
Keywords
- Adaptive mesh refinement
- Coupled elliptic-hyperbolic systems
- Finite different methods
- Numerical methods
- Numerical relativity