Related papers: LIRK-W: Linearly-implicit Runge-Kutta methods with…

In this work, we construct novel discretizations for the unsteady convection-diffusion equation. Our discretization relies on multiderivative time integrators together with a novel discretization that reduces the total number of unknowns…

Combining ideas from [Alouges et al. (Numer. Math., 128, 2014)] and [Praetorius et al. (Comput. Math. Appl., 2017)], we propose a numerical algorithm for the integration of the nonlinear and time-dependent Landau-Lifshitz-Gilbert (LLG)…

In this work we consider a mixed precision approach to accelerate the implemetation of multi-stage methods. We show that Runge-Kutta methods can be designed so that certain costly intermediate computations can be performed as a…

This work constructs and analyzes new efficient high-order two-derivative diagonally implicit Runge--Kutta (TDDIRK) schemes with optimized phase errors. Specifically, we present a convergence result for TDDIRK methods and investigate their…

The non-differentiability of the singular nonlinearity (such as $f=\ln|u|^2$) at $u=0$ presents significant challenges in devising accurate and efficient numerical schemes for the logarithmic Schr\"{o}dinger equation (LogSE). To address…

This paper introduces a new class of numerical methods for the time integration of evolution equations set as Cauchy problems of ODEs or PDEs. The systematic design of these methods mixes the Runge-Kutta collocation formalism with…

With the increasing industrial demands, two families of high-order numerical schemes are widely used within the computational fluid dynamics community. One is the method of line, which relies on Runge-Kutta (RK) time-stepping applied to a…

Traditional time discretization methods use a single timestep for the entire system of interest and can perform poorly when the dynamics of the system exhibits a wide range of time scales. Multirate infinitesimal step (MIS) methods (Knoth…

In a previous paper, a technique was suggested to avoid order reduction with any explicit exponential Runge-Kutta method when integrating initial boundary value nonlinear problems with time-dependent boundary conditions. In this paper, we…

While implicit Runge--Kutta methods possess high order accuracy and important stability properties, implementation difficulties and the high expense of solving the coupled algebraic system at each time step are frequently cited as…

We consider the construction of semi-implicit linear multistep methods which can be applied to time dependent PDEs where the separation of scales in additive form, typically used in implicit-explicit (IMEX) methods, is not possible. As…

This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. The proposed methods are based on a specific subset of explicit one-step…

Identifying governing equations in physical and biological systems from datasets remains a long-standing challenge across various scientific disciplines, providing mechanistic insights into complex system evolution. Common methods like…

The use of high order fully implicit Runge-Kutta methods is of significant importance in the context of the numerical solution of transient partial differential equations, in particular when solving large scale problems due to fine space…

This paper introduces a novel paradigm for constructing linearly implicit and high-order unconditionally energy-stable schemes for general gradient flows, utilizing the scalar auxiliary variable (SAV) approach and the additive Runge-Kutta…

An additive Runge-Kutta method is used for the time stepping, which integrates the linear stiff terms by an explicit singly diagonally implicit Runge-Kutta (ESDIRK) method and the nonlinear terms by an explicit Runge-Kutta (ERK) method. In…

This article extends the theory of dual-consistent summation-by-parts (SBP) and generalized SBP (GSBP) time-marching methods by showing that they are implicit Runge-Kutta schemes. Through this connection, the accuracy theory for the…

We show that symplectic and linearly-implicit integrators proposed by [Zhang and Skeel, 1997] are variational linearizations of Newmark methods. When used in conjunction with penalty methods (i.e., methods that replace constraints by stiff…

Runge-Kutta time-stepping methods in general suffer from order reduction: the observed order of convergence may be less than the formal order when applied to certain stiff problems. Order reduction can be avoided by using methods with high…

This study concerns numerical methods for efficiently solving the Richards equation where different weak formulations and computational techniques are analyzed. The spatial discretizations are based on standard or mixed finite element…