Related papers: Discrete adjoint computations for relaxation Runge…
In this note, we connect two different topics from linear algebra and numerical analysis: hypocoercivity of semi-dissipative matrices and strong stability for explicit Runge--Kutta schemes. Linear autonomous ODE systems with a non-coercive…
In this paper, we consider stochastic Runge-Kutta methods for stochastic Hamiltonian partial differential equations and present some sufficient conditions for multisymplecticity of stochastic Runge-Kutta methods of stochastic Hamiltonian…
Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were proposed and analyzed in 4. These specially designed methods use reduced precision for the implicit computations and full…
In this paper we consider time-dependent PDEs discretized by a special class of Physics Informed Neural Networks whose design is based on the framework of Runge--Kutta and related time-Galerkin discretizations. The primary motivation for…
We study gradient-based optimization methods obtained by directly discretizing a second-order ordinary differential equation (ODE) related to the continuous limit of Nesterov's accelerated gradient method. When the function is smooth…
Direct methods for the simulation of optimal control problems apply a specific discretization to the dynamics of the problem, and the discrete adjoint method is suitable to calculate corresponding conditions to approximate an optimal…
In [Baeza et al., Computers and Fluids, 159, 156--166 (2017)] a new method for the numerical solution of ODEs is presented. This methods can be regarded as an approximate formulation of the Taylor methods and it follows an approach that has…
There exist many Runge-Kutta methods (explicit or implicit), more or less adapted to specific problems. Some of them have interesting properties, such as stability for stiff problems or symplectic capability for problems with energy…
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…
This paper follows up on the author's recent paper "Entropy Production by Explicit Runge-Kutta schemes", where a formula for the production of entropy by fully discrete schemes with explicit Runge-Kutta time integrators was presented. In…
In this paper, a family of arbitrarily high-order structure-preserving exponential Runge-Kutta methods are developed for the nonlinear Schr\"odinger equation by combining the scalar auxiliary variable approach with the exponential…
We introduce a class of exponential Runge-Kutta integration methods for kinetic equations. The methods are based on a decomposition of the collision operator into an equilibrium and a non equilibrium part and are exact for relaxation…
We put forward the use of total-variation-diminishing (or more generally, strong stability preserving) implicit-explicit Runge-Kutta methods for the time integration of the equations of motion associated with the semiconvection problem in…
In this paper, we extend the Paired-Explicit Runge-Kutta schemes by Vermeire et. al. to fourth-order of consistency. Based on the order conditions for partitioned Runge-Kutta methods we motivate a specific form of the Butcher arrays which…
It is well known that symplectic Runge-Kutta and Partitioned Runge-Kutta methods exactly preserve {\em quadratic} first integrals (invariants of motion) of the system being integrated. While this property is often seen as a mere curiosity…
We introduce a second-order time discretization method for stiff kinetic equations. The method is asymptotic-preserving (AP) -- can capture the Euler limit without numerically resolving the small Knudsen number; and positivity-preserving --…
Many control, optimization, and learning algorithms rely on discretizations of continuous-time contracting systems, where preservation of contractivity under numerical integration is key for stability, robustness, and reliable fixed-point…
In this paper, we present error estimates of fully discrete Runge--Kutta discontinuous Galerkin (DG) schemes for linear time-dependent partial differential equations. The analysis applies to explicit Runge--Kutta time discretizations of any…
The aim of this paper is to construct and analyze explicit exponential Runge-Kutta methods for the temporal discretization of linear and semilinear integro-differential equations. By expanding the errors of the numerical method in terms of…
A space-time fully adaptive multiresolution method for evolutionary non-linear partial differential equations is presented introducing an improved local time-stepping method. The space discretisation is based on classical finite volumes,…