Related papers: Implicit-Explicit Integral Deferred Correction Met…

In this workshop, we discuss several algorithms for mathematical programs with equilibrium constraints (MPECs). The unifying theme is that MPECs are optimization problems whose feasible set contains a lower-level equilibrium system, often…

Strong stability preserving (SSP) Runge-Kutta methods are often desired when evolving in time problems that have two components that have very different time scales. Where the SSP property is needed, it has been shown that implicit and…

In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…

Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve efficiently large systems of differential equations that have a stiff linear part, e.g. reaction-diffusion systems. However, the use of approximate…

For many systems of differential equations modeling problems in science and engineering, there are often natural splittings of the right hand side into two parts, one of which is non-stiff or mildly stiff, and the other part is stiff. Such…

Low-rank methods for kinetic equations have attracted increasing attention due to their effectiveness in reducing the high dimensionality of phase space. In our previous work [G. Wang & J. Hu, J. Comput. Phys. 558 (2026) 114884], we…

We propose an implementation of symplectic implicit Runge-Kutta schemes for highly accurate numerical integration of non-stiff Hamiltonian systems based on fixed point iteration. Provided that the computations are done in a given floating…

This paper introduces the Runge-Kutta Chebyshev descent method (RKCD) for strongly convex optimisation problems. This new algorithm is based on explicit stabilised integrators for stiff differential equations, a powerful class of numerical…

In this paper we continue the work on implicit-explicit (IMEX) time discretizations for the incompressible Oseen equations that we started in \cite{BGG23} (E. Burman, D. Garg, J. Guzm\`an, {\emph{Implicit-explicit time discretization for…

Implicit-explicit Runge-Kutta (IMEX-RK) time discretization methods are very popular when solving stiff kinetic equations. In [21], an asymptotic analysis shows that a specific class of high-order IMEX-RK schemes can accurately capture the…

We propose a model order reduction framework for incompressible fluid-structure interaction (FSI) problems based on high-order implicit Runge-Kutta (IRK) methods. We consider separate reduced spaces for fluid velocity, fluid pressure and…

We study a discrete-time random feature method for nonlinear, time-dependent partial differential equations. In contrast to continuous-time formulations that treat time as an additional input variable, the method advances the solution step…

In order to solve continuous-time optimal control problems, direct methods transcribe the infinite-dimensional problem to a nonlinear program (NLP) using numerical integration methods. In cases where the integration error can be manipulated…

This paper presents a sequence of deferred correction (DC) schemes built recursively from the implicit midpoint scheme for the numerical solution of general first order ordinary differential equations (ODEs). It is proven that each scheme…

We note a fact that stiff systems or differential equations that have highly oscillatory solutions cannot be solved efficiently using conventional methods. In this paper, we study two new classes of exponential Runge-Kutta (ERK) integrators…

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, a new implicit-explicit local method with an arbitrary order is produced for stiff initial value problems. Here, a general method for one-step time integrations has been created, considering a direction free approach for…

We investigate the use of inexact solves for interpolatory model reduction and consider associated perturbation effects on the underlying model reduction problem. We give bounds on system perturbations induced by inexact solves and relate…

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 paper proposes a new method for differentiating through optimal trajectories arising from non-convex, constrained discrete-time optimal control (COC) problems using the implicit function theorem (IFT). Previous works solve a…