Related papers: D-splitting methods: 2N -storage embedded explicit…
Symplectic partitioned Runge--Kutta methods can be obtained from a variational formulation where all the terms in the discrete Lagrangian are treated with the same quadrature formula. We construct a family of symplectic methods allowing the…
The paper develops high order accurate Runge-Kutta discontinuous local evolution Galerkin (RKDLEG) methods on the cubed-sphere grid for the shallow water equations (SWEs). Instead of using the dimensional splitting method or solving…
The residual-based variational multiscale (VMS) formulation has achieved remarkable success in large-eddy simulation of turbulent flows. However, its temporal discretization has largely remained limited to second-order implicit schemes. The…
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, Runge-Kutta-Gegenbauer (RKG) stability polynomials of arbitrarily high order of accuracy are introduced in closed form. The stability domain of RKG polynomials extends in the the real direction with the square of polynomial…
Computer simulations in QCD are based on the discretization of the theory on a Euclidean lattice. To compute the mean value of an observable, usually the Hybrid Monte Carlo method is applied. Here equations of motion, derived from an…
Splitting-based time integration approaches such as fractional steps, alternating direction implicit, operator splitting, and locally one-dimensional methods partition the system of interest into components and solve individual components…
We study the construction and convergence of semi-explicit and iterative decoupling schemes for an elliptic-parabolic problem using higher-order Runge-Kutta methods. For the semi-explicit schemes, which are constructed using a nearby delay…
In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta…
Exponential Runge-Kutta methods constitute efficient integrators for semilinear stiff problems. So far, however, explicit exponential Runge-Kutta methods are available in the literature up to order 4 only. The aim of this paper is to…
Hamiltonian systems are one of the most important class of dynamical systems with a geometric structure called symplecticity and the numerical algorithms which can preserve such geometric structure are of interest. In this article we study…
We introduce a high-order space-time approximation of the Shallow Water Equations with sources that is invariant-domain preserving (IDP) and well-balanced with respect to rest states. The employed time-stepping technique is a novel explicit…
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…
The goal of this paper is to develop 2nd order Implicit-Explicit Runge-Kutta (IMEX-RK) finite volume (FV) schemes for solving 1d parabolic PDEs for option pricing, with possible nonlinearities in the source and advection terms. The spatial…
We present a novel and general methodology for building second-order finite volume implicit-explicit Runge-Kutta numerical schemes for solving two-dimensional financial parabolic PDEs with mixed derivatives. The methods achieve second-order…
A general purpose, modular program package for the integration of large number of independent ordinary differential equation systems capable of using professional graphics cards is presented. The available numerical schemes are the explicit…
The flux vector splitting (FVS) method has firstly been incorporated into the discontinuous Galerkin (DG) framework for reconstructing the numerical fluxes required for the spatial semi-discrete formulation, setting it apart from the…
A methodology that can generate the optimal coefficients of a numerical method with the use of an artificial neural network is presented in this work. The network can be designed to produce a finite difference algorithm that solves a…
Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global…
A wide range of physical phenomena exhibit auxiliary admissibility criteria, such as conservation of entropy or various energies, which arise implicitly under exact solution of their governing PDEs. However, standard temporal schemes, such…