Adaptive mesh refinement with subcycling in time enables different grid levels to advance using their own time steps, ensuring finer grids employ smaller steps for accuracy while coarser grids take larger steps to improve computational efficiency. We present the development, validation, and performance analysis of a subcycling in time algorithm implemented within the carpetx driver in the einstein toolkit framework. This new approach significantly improves upon the previous subcycling implementation in the carpet driver by achieving higher-order convergence—fourth order in time instead of second order—and enhanced scaling performance. The key innovation lies in optimizing the exchange of ghost points at refinement boundaries, limiting it to the same number as those at interprocess boundaries using dense output from coarser levels, thereby reducing computational and communication overhead compared to the implementation in carpet, which required a larger number of buffer zones. To validate the algorithm, we first demonstrate its fourth-order convergence using a scalar wave test. We then apply the algorithm to binary black hole simulations, confirming its robustness and accuracy in a realistic astrophysical scenario. The results show excellent agreement with the well-established lazev code. Scaling tests on CPU (Frontera) and GPU (Vista) clusters reveal significant performance gains, with the new implementation achieving improved speed and scalability compared to the carpet-based version.

Close

PrevNext

View figure in article

• Classical black holes
• General relativity
• Numerical relativity