Related papers: Local time-stepping for adaptive multiresolution u…
We consider high order, implicit Runge-Kutta schemes to solve time-dependent stiff PDEs on dynamically adapted grids generated by multiresolution analysis for unsteady problems disclosing localized fronts. The multiresolution finite volume…
Solving the reactive low-Mach Navier-Stokes equations with high-order adaptive methods in time is still a challenging problem, in particular due to the handling of the algebraic variables involved in the mass constraint. We focus on the…
A nonlinear adaptive procedure for optimising both the schemes in time and space is proposed in view of increasing the numerical efficiency and reducing the computational time. The method is based on a four-parameter family of schemes we…
Irksome is a library based on the Unified Form Language (UFL) that automates the application of Runge-Kutta time-stepping methods for finite element spatial discretizations of partial differential equations (PDEs). This paper describes…
We propose a numerical scheme to solve the time dependent linear Schr\"odinger equation. The discretization is carried out by combining a Runge-Kutta time-stepping scheme with a finite element discretization in space. Since the…
This paper investigates the energy conservation properties of explicit Runge--Kutta (RK) time discretizations for autonomous skew-symmetric systems. For linear problems, we present a general framework for constructing RK methods in which…
In this paper, we present error estimates of fully discrete Runge--Kutta discontinuous Galerkin (DG) schemes for linear time-dependent partial differential equations. The analysis applies to explicit Runge--Kutta time discretizations of any…
This paper introduces an adaptive time splitting technique for the solution of stiff evolutionary PDEs that guarantees an effective error control of the simulation, independent of the fastest physical time scale for highly unsteady…
In this paper we consider time-dependent PDEs discretized by a special class of Physics Informed Neural Networks whose design is based on the framework of Runge--Kutta and related time-Galerkin discretizations. The primary motivation for…
We propose a kernel compression method for solving Distributed-Order (DO) Fractional Partial Differential Equations (DOFPDEs) at the cost of solving corresponding local-in-time PDEs. The key concepts are (1) discretization of the integral…
We put forward the use of total-variation-diminishing (or more generally, strong stability preserving) implicit-explicit Runge-Kutta methods for the time integration of the equations of motion associated with the semiconvection problem in…
Finite element discretization of time dependent problems also require effective time-stepping schemes. While implicit Runge-Kutta methods provide favorable accuracy and stability problems, they give rise to large and complicated systems of…
We study Runge-Kutta methods for rough differential equations which can be used to calculate solutions to stochastic differential equations driven by processes that are rougher than a Brownian motion. We use a Taylor series representation…
We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge--Kutta--Legendre (RKL) and Runge--Kutta--Gegenbauer (RKG) super-time-stepping methods were…
Mixed precision Runge--Kutta methods have been recently developed and used for the time-evolution of partial differential equations. Two-derivative Runge--Kutta schemes may offer enhanced stability and accuracy properties compared to…
In this work, we present a modification of explicit Runge-Kutta temporal integration schemes that guarantees the preservation of any locally-defined quasiconvex set of bounds for the solution. These schemes operate on the basis of a…
This work focuses on the numerical study of a recently published class of Runge-Kutta methods designed for mixed-precision arithmetic. We employ the methods in solving partial differential equations on modern hardware. In particular we…
This paper illuminates the derivation, the applicability, and the efficiency of the Multiplicative Runge-Kutta Method, derived in the frame- work of geometric multiplicative calculus. The removal of the restrictions of geometric…
We propose entropy-preserving and entropy-stable partitioned Runge--Kutta (RK) methods. In particular, we extend the explicit relaxation Runge--Kutta methods to IMEX--RK methods and a class of explicit second-order multirate methods for…
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…