Related papers: Simplified explicit exponential Runge-Kutta method…
We study the connections between ordinary differential equations and optimization algorithms in a non-Euclidean setting. We propose a novel accelerated algorithm for minimising convex functions over a convex constrained set. This algorithm…
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…
This paper continues to study the explicit two-stage fourth-order accurate time discretiza- tions [5, 7]. By introducing variable weights, we propose a class of more general explicit one-step two-stage time discretizations, which are…
Relaxation Runge-Kutta methods reproduce a fully discrete dissipation (or conservation) of entropy for entropy stable semi-discretizations of nonlinear conservation laws. In this paper, we derive the discrete adjoint of relaxation…
A new method for the numerical solution of ODEs is presented. This approach is based on an approximate formulation of the Taylor methods that has a much easier implementation than the original Taylor methods, since only the functions in the…
The aim of this paper is to design the explicit radial basis function (RBF) Runge-Kutta methods for the initial value problem. We construct the two-, three- and four-stage RBF Runge-Kutta methods based on the Gaussian RBF Euler method with…
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,…
For the approximation of solutions for stochastic partial differential equations, numerical methods that obtain a high order of convergence and at the same time involve reasonable computational cost are of particular interest. We therefore…
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 an efficient algorithm for the approximation of fractional integrals by using Runge--Kutta based convolution quadrature. The algorithm is based on a novel integral representation of the convolution weights and a special…
Recently, a new class of second order Runge-Kutta methods for It\^o stochastic differential equations with a multidimensional Wiener process was introduced by R\"o{\ss}ler. In contrast to second order methods earlier proposed by other…
In this paper, we develop a general framework for constructing higher-order, unconditionally energy-stable exponential time differencing Runge-Kutta methods applicable to a range of gradient flows. Specifically, we identify conditions…
In this article, we derive fast and robust parallel-in-time preconditioned iterative methods for the all-at-once linear systems arising upon discretization of time-dependent PDEs. The discretization we employ is based on a Runge--Kutta…
A novel class of explicit high-order energy-preserving methods are proposed for general Hamiltonian partial differential equations with non-canonical structure matrix. When the energy is not quadratic, it is firstly done that the original…
This paper considers the numerical integration of semilinear evolution PDEs using the high order linearly implicit methods developped in a previous paper in the ODE setting. These methods use a collocation Runge--Kutta method as a basis,…
In this article, a family of two- and three-stage explicit multiquadric (MQ) and inverse multiquadric (IMQ) radial basis functions (RBFs) Runge-Kutta methods are introduced for solving ordinary differential equations. These methods are…
Classical and new numerical schemes are generated using evolutionary computing. Differential Evolution is used to find the coefficients of finite difference approximations of function derivatives, and of single and multi-step integration…
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 main objective of this series of papers is to explore the entire landscape of numerical methods for fast nonlinear Fourier transformation (NFT) within the class of integrators known as the exponential integrators. In this paper, we…
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…