Related papers: Toward a Consistent Framework for High Order Mesh …
Efforts to achieve better accuracy in numerical relativity have so far focused either on implementing second order accurate adaptive mesh refinement or on defining higher order accurate differences and update schemes. Here, we argue for the…
We present a fourth-order projection method with adaptive mesh refinement (AMR) for numerically solving the incompressible Navier-Stokes equations (INSE) with subcycling in time. Our method features (i) a reformulation of INSE so that the…
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…
I consider techniques for Berger-Oliger adaptive mesh refinement (AMR) when numerically solving partial differential equations with wave-like solutions, using characteristic (double-null) grids. Such AMR algorithms are naturally recursive,…
In this paper we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier-Stokes equations. The algorithm uses a finite volume approach that…
Context: Calculating stellar pulsations requires a sufficient accuracy to match the quality of the observations. Many current pulsation codes apply a second order finite-difference scheme, combined with Richardson extrapolation to reach…
We discuss refinement criteria for the Berger-Rigoutsos (block-based) refinement algorithm in our numerical relativity code GR-Athena++ in the context of binary black hole merger simulations. We compare three different strategies: the…
Full interpretation of data from gravitational wave observations will require accurate numerical simulations of source systems, particularly binary black hole mergers. A leading approach to improving accuracy in numerical relativity…
This work introduces an adaptive mesh refinement technique for hierarchical hybrid grids with the goal to reach scalability and maintain excellent performance on massively parallel computer systems. On the block structured hierarchical…
We present an algorithm for treating mesh refinement interfaces in numerical relativity. We detail the behavior of the solution near such interfaces located in the strong field regions of dynamical black hole spacetimes, with particular…
Numerical evolution of the spherically symmetric, massive Klein-Gordon field is presented using a new adaptive mesh refinement (AMR) code with fourth order discretization in space and time, along with compactification in space. The system…
Convergence failure and slow convergence rates are among the biggest challenges with solving the system of non-linear equations numerically. Although mitigated, such issues still linger when using strictly small time steps and…
In this paper, we extend the Paired-Explicit Runge-Kutta schemes by Vermeire et. al. to fourth-order of consistency. Based on the order conditions for partitioned Runge-Kutta methods we motivate a specific form of the Butcher arrays which…
High-order spatial discretisations and full discretisations of parabolic partial differential equations on evolving surfaces are studied. We prove convergence of the high-order evolving surface finite element method, by showing high-order…
Explicit Runge-Kutta schemes with large stable step sizes are developed for integration of high order spectral difference spatial discretization on quadrilateral grids. The new schemes permit an effective time step that is substantially…
In this article, we propose novel boundary treatment algorithms to avoid order reduction when implicit-explicit Runge-Kutta time discretization is used for solving convection-diffusion-reaction problems with time-dependent Di\-richlet…
In this paper, we apply the Paired-Explicit Runge-Kutta (P-ERK) schemes by Vermeire et. al. (2019, 2022) to dynamically partitioned systems arising from adaptive mesh refinement. The P-ERK schemes enable multirate time-integration with no…
The use of adaptive mesh refinement (AMR) techniques is crucial for accurate and efficient simulation of higher dimensional spacetimes. In this work we develop an adaptive algorithm tailored to the integration of finite difference…
We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While for structured 2D meshes, one can refine elements alternatingly in horizontal and vertical direction, such an approach cannot be generalized directly…
In recent work we have shown how an accurate reduced model can be utilized to perform mesh refinement in random space. That work relied on the explicit knowledge of an accurate reduced model which is used to monitor the transfer of activity…