Related papers: A new way of deriving implicit Runge-Kutta methods…
In this work, we aim at constructing numerical schemes, that are as efficient as possible in terms of cost and conservation of invariants, for the Vlasov--Fokker--Planck system coupled with Poisson or Amp\`ere equation. Splitting methods…
We introduce a class of high order accurate, semi-implicit Runge-Kutta schemes in the general setting of evolution equations that arise as gradient flow for a cost function, possibly with respect to an inner product that depends on the…
In this paper, we develop a higher order symmetric partitioned Runge-Kutta method for a coupled system of differential equations on Lie groups. We start with a discussion on partitioned Runge-Kutta methods on Lie groups of arbitrary order.…
Data-driven modeling of nonlinear dynamical systems is often hampered by measurement noise. We propose a denoising framework, called Runge-Kutta and Total Variation Based Implicit Neural Representation (RKTV-INR), that represents the state…
Recent years have seen an increasing amount of research devoted to the development of so-called resonance-based methods for dispersive nonlinear partial differential equations. In many situations, this new class of methods allows for…
We present an approach for the efficient implementation of self-adjusting multi-rate Runge-Kutta methods and we introduce a novel stability analysis, that covers the multi-rate extensions of all standard Runge-Kutta methods and allows to…
A new format for commutator-free Lie group methods is proposed based on explicit classical Runge-Kutta schemes. In this format exponentials are reused at every stage and the storage is required only for two quantities: the right hand side…
The work deals with two major topics concerning the numerical analysis of Runge-Kutta-like (RK-like) methods, namely their stability and order of convergence. RK-like methods differ from additive RK methods in that their coefficients are…
One of main obstacles in verifying the energy dissipation laws of implicit-explicit Runge-Kutta (IERK) methods for phase field equations is to establish the uniform boundedness of stage solutions without the global Lipschitz continuity…
In this paper, authors successfully construct a new algorithm for the new higher order scheme of weak approximation of SDEs. The algorithm presented here is based on [1][2]. Although this algorithm shares some features with the algorithm…
We consider systems of ordinary differential equations with known first integrals. The notion of a discrete tangent space is introduced as the orthogonal complement of an arbitrary set of discrete gradients. Integrators which exactly…
Constructing explicit Runge--Kutta (ERK) methods with as few stages as possible for a given order is a classical problem in numerical analysis. In this work, we introduce a $Q$/$D$-space framework of sufficient order conditions for ERK…
One main issue, when numerically integrating autonomous Hamiltonian systems, is the long-term conservation of some of its invariants, among which the Hamiltonian function itself. Recently, a new class of methods, named Hamiltonian Boundary…
We present high-order, fully explicit projective integration schemes for nonlinear collisional kinetic equations such as the BGK and Boltzmann equation. The methods first take a few small (inner) steps with a simple, explicit method (such…
Classical convergence theory of Runge-Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic…
In research problems that involve the use of numerical methods for solving systems of ordinary differential equations (ODEs), it is often required to select the most efficient method for a particular problem. To solve a Cauchy problem for a…
We demonstrate the effectiveness of a novel scheme for numerically solving linear differential equations whose solutions exhibit extreme oscillation. We take a standard Runge-Kutta approach, but replace the Taylor expansion formula with a…
This work introduces a general framework for constructing high-order, linearly stable, partitioned solvers for multiphysics problems from a monolithic implicit-explicit Runge-Kutta (IMEX-RK) discretization of the semi-discrete equations.…
Identifying computational tasks suitable for (future) quantum computers is an active field of research. Here we explore utilizing quantum computers for the purpose of solving differential equations. We consider two approaches: (i) basis…
Many time-dependent differential equations are equipped with invariants. Preserving such invariants under discretization can be important, e.g., to improve the qualitative and quantitative properties of numerical solutions. Recently,…