Related papers: Optimized Runge-Kutta Methods with Automatic Step …
We study temporal step size control of explicit Runge-Kutta methods for compressible computational fluid dynamics (CFD), including the Navier-Stokes equations and hyperbolic systems of conservation laws such as the Euler equations. We…
We present a new method for developing time step controllers based on a technique from the field of machine learning. This method is applicable to stable time integrators that have an embedded scheme, i.e., that have local error estimation…
In current research, we analyse dissipation and dispersion characteristics of most accurate two and three stage Gauss-Legendre implicit Runge-Kutta (R-K) methods. These methods, known for their $A$-stability and immense accuracy, are…
Many time-dependent differential equations are equipped with invariants. Preserving such invariants under discretization can be important, e.g., to improve the qualitative and quantitative properties of numerical solutions. Recently,…
New time integration methods are proposed for simulating incompressible multiphase flow in pipelines described by the one-dimensional two-fluid model. The methodology is based on 'half-explicit' Runge-Kutta methods, being explicit for the…
The application of Runge-Kutta schemes designed to enjoy a large region of absolute stability can significantly increase the efficiency of numerical methods for PDEs based on a method of lines approach. In this work we investigate the…
We present the formulation and optimization of a Runge-Kutta-type time-stepping scheme for solving the shallow water equations, aimed at substantially increasing the effective allowable time-step over that of comparable methods. This…
We construct a family of embedded pairs for optimal strong stability preserving explicit Runge-Kutta methods of order $2 \leq p \leq 4$ to be used to obtain numerical solution of spatially discretized hyperbolic PDEs. In this construction,…
There exist many Runge-Kutta methods (explicit or implicit), more or less adapted to specific problems. Some of them have interesting properties, such as stability for stiff problems or symplectic capability for problems with energy…
A wide range of physical phenomena exhibit auxiliary admissibility criteria, such as conservation of entropy or various energies, which arise implicitly under the exact solution of their governing PDEs. However, standard temporal schemes,…
The Courant-Friedrichs-Lewy (CFL) condition is a well known, necessary condition for the stability of explicit time-stepping schemes that effectively places a limit on the size of the largest admittable time-step for a given problem. We…
A posteriori error estimates based on residuals can be used for reliable error control of numerical methods. Here, we consider them in the context of ordinary differential equations and Runge-Kutta methods. In particular, we take the…
We consider the efficient numerical solution of coupled dynamical systems, consisting of a small nonlinear part and a large linear time invariant part, possibly stemming from spatial discretization of an underlying partial differential…
Compact Runge-Kutta (cRK) methods are a class of high order methods for solving hyperbolic conservation laws characterized by their compact stencil including only immediate neighboring finite elements. A Compact Runge-Kutta flux…
Compact Runge-Kutta (cRK) Flux Reconstruction (FR) methods are a variant of RKFR methods for hyperbolic conservation laws with a compact stencil including only immediate neighboring finite elements. We extend cRKFR methods to handle…
Compact Runge-Kutta (cRK) Discontinuous Galerkin (DG) methods, recently introduced in [Q. Chen, Z. Sun, and Y. Xing, SIAM J. Sci. Comput. SIAM J. Sci. Comput., 46: A1327-A1351, 2024], are a variant of RKDG methods for solving hyperbolic…
Time integration of Fourier pseudo-spectral DNS is usually performed using the classical fourth-order accurate Runge--Kutta method, or other methods of second or third order, with a fixed step size. We investigate the use of higher-order…
In this work we consider a mixed precision approach to accelerate the implemetation of multi-stage methods. We show that Runge-Kutta methods can be designed so that certain costly intermediate computations can be performed as a…
As supercomputers grow in hardware complexity, their susceptibility to faults increases and measures need to be taken to ensure the correctness of results. Some numerical algorithms have certain characteristics that allow them to recover…
Explicit integrating factor Runge-Kutta methods are attractive and popular in developing high-order maximum bound principle preserving time-stepping schemes for Allen-Cahn type gradient flows. However, they always suffer from the…