Related papers: Explicit radial basis function Runge-Kutta methods

A time discretization method is called strongly stable, if the norm of its numerical solution is nonincreasing. It is known that, even for linear semi-negative problems, many explicit Runge--Kutta (RK) methods fail to preserve this…

To achieve efficient and accurate long-time integration, we propose a fast, accurate, and stable high-order numerical method for solving fractional-in-space reaction-diffusion equations. The proposed method is explicit in nature and…

We study the application of the generalized convolution quadrature (gCQ) based on Runge--Kutta methods to approximate the solution of an important class of sectorial problems. The gCQ generalizes Lubich's original convolution quadrature…

This manuscript introduces a fourth-order Runge-Kutta based implicit-explicit scheme in time along with compact fourth-order finite difference scheme in space for the solution of one-dimensional Kuramoto-Sivashinsky equation with periodic…

High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The…

We present adaptive finite difference ENO/WENO methods by adopting infinitely smooth radial basis functions (RBFs). This is a direct extension of the non-polynomial finite volume ENO/WENO method proposed by authors in \cite{GuoJung} to the…

A mixed accuracy framework for Runge--Kutta methods presented in Grant [JSC 2022] and applied to diagonally implicit Runge--Kutta (DIRK) methods can significantly speed up the computation by replacing the implicit solver by less expensive…

Recent developments have made it possible to overcome grid-based limitations of finite difference (FD) methods by adopting the kernel-based meshless framework using radial basis functions (RBFs). Such an approach provides a meshless…

Cell collective migration plays a crucial role in a variety of physiological processes. In this work, we propose the Runge-Kutta random feature method to solve the nonlinear and strongly coupled multiphase flow problems of cells, in which…

In this paper, we present a spectral method based on Radial Basis Functions (RBFs) for numerically solving the fully nonlinear 1D Serre Green-Naghdi equations. The approximation uses an RBF discretization in space and finite differences in…

A new projection method based on radial basis functions (RBFs) is presented for discretizing the incompressible unsteady Stokes equations in irregular geometries. The novelty of the method comes from the application of a new technique for…

A practical and new Runge--Kutta numerical scheme for stochastic differential equations is explored. Numerical examples demonstrate the strong convergence of the method. The first order strong convergence is then proved using Ito integrals…

In this article we present a modification of classical Radial Basis Function (RBF) interpolation techniques aimed at reducing oscillations near discontinuities in one and two dimensions. Our approach introduces an adaptive mechanism by…

In \cite{ZH2019}, we developed a boundary treatment method for implicit-explicit (IMEX) Runge-Kutta (RK) methods for solving hyperbolic systems with source terms. Since IMEX RK methods include explicit ones as special cases, this boundary…

The aim of this chapter is to show how option prices in jump-diffusion models can be computed using meshless methods based on Radial Basis Function (RBF) interpolation. The RBF technique is demonstrated by solving the partial…

Recently, collocation based radial basis function (RBF) partition of unity methods (PUM) for solving partial differential equations have been formulated and investigated numerically and theoretically. When combined with stable evaluation…

Fractional-step methods are a popular and powerful divide-and-conquer approach for the numerical solution of differential equations. When the integrators of the fractional steps are Runge--Kutta methods, such methods can be written as…

We compare the three main types of high-order one-step initial value solvers: extrapolation, spectral deferred correction, and embedded Runge--Kutta pairs. We consider orders four through twelve, including both serial and parallel…

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…

Symmetry is a key property of numerical methods. The geometric properties of symmetric schemes make them an attractive option for integrating Hamiltonian systems, whilst their ability to exactly recover the initial condition without the…