Related papers: Implicit multirate GARK methods
In this study, we propose high-order implicit and semi-implicit schemes for solving ordinary differential equations (ODEs) based on Taylor series expansion. These methods are designed to handle stiff and non-stiff components within a…
In this paper stochastic partitioned Runge-Kutta (SPRK) methods are considered. A general order theory for SPRK methods based on stochastic B-series and multicolored, multishaped rooted trees is developed. The theory is applied to prove the…
Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that…
When one wishes to numerically solve an initial value problem, it is customary to rewrite it as an equivalent first-order system to which a method, usually from the class of Runge-Kutta methods, is applied. Directly treating higher-order…
Explicit stabilized methods are an efficient alternative to implicit schemes for the time integration of stiff systems of differential equations in large dimension. In this paper, we derive explicit stabilized integrators of orders one and…
Many practical problems can be described by second-order system $\ddot{q}=-M\nabla U(q)$, in which people give special emphasis to some invariants with explicit physical meaning, such as energy, momentum, angular momentum, etc. However,…
The task of integrating a large number of independent ODE systems arises in various scientific and engineering areas. For nonstiff systems, common explicit integration algorithms can be used on GPUs, where individual GPU threads…
Modified Patankar-Runge-Kutta (MPRK) methods preserve the positivity as well as conservativity of a production-destruction system (PDS) of ordinary differential equations for all time step sizes. As a result, higher order MPRK schemes do…
In this paper, a time-periodic MGRIT algorithm is proposed as a means to reduce the time-to-solution of numerical algorithms by exploiting the time periodicity inherent to many applications in science and engineering. The time-periodic…
Classical neural ODEs trained with explicit methods are intrinsically limited by stability, crippling their efficiency and robustness for stiff learning problems that are common in graph learning and scientific machine learning. We present…
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…
A high-order accurate adjoint-based optimization framework is presented for unsteady multiphysics problems. The fully discrete adjoint solver relies on the high-order, linearly stable, partitioned solver introduced in [1], where different…
Runge-Kutta (RK) methods may exhibit order reduction when applied to certain stiff problems. While fully implicit RK schemes exist that avoid order reduction via high-stage order, DIRK (diagonally implicit Runge-Kutta) schemes are…
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…
We propose a family of integrators, Flow-Composed Implicit Runge-Kutta (FCIRK) methods, for perturbations of nonlinear ordinary differential equations, consisting of the composition of flows of the unperturbed part alternated with one step…
In this paper, two new families of fourth-order explicit exponential Runge--Kutta (ERK) methods with four stages are studied for solving first-order differential systems $y'(t)+My(t)=f(y(t))$. By comparing the Taylor series of the exact…
We propose a second-order implicit-explicit (IMEX) time-stepping scheme for the isentropic, compressible Cahn-Hilliard-Navier-Stokes equations discretized on staggered (MAC) grids. The scheme is based on finite difference approximations…
The efficient solution of large-scale multiterm linear matrix equations is a challenging task in numerical linear algebra, and it is a largely open problem. We propose a new iterative scheme for symmetric and positive definite operators,…
The problem of solving stochastic differential-algebraic equations (SDAEs) of index one with a scalar driving Brownian motion is considered. Recently, the authors proposed a class of stiffly accurate stochastic Runge-Kutta (SRK) methods…
We combine the recent relaxation approach with multiderivative Runge-Kutta methods to preserve conservation or dissipation of entropy functionals for ordinary and partial differential equations. Relaxation methods are minor modifications of…