Related papers: Runge-Kutta methods for rough differential equatio…
Differential equations are important tools to portray dynamic problems, and are widely used in finance, engineering and biology. Here, multiple dynamic differential models were built innovatively, and discretized with the Runge-Kutta…
In this paper a technique is given to recover the classical order of the method when explicit exponential Runge-Kutta methods integrate reaction-diffusion problems. Although methods of high stiff order for problems with vanishing boundary…
An approach is treated for numerical integration of ordinary differential equations systems of the first order with choice of a computation scheme, ensuring the required local precision. The treatment is made on the basis of schemes of…
This work presents a new evolutionary optimization algorithm in theoretical mathematics with important applications in scientific computing. The use of the evolutionary algorithm is justified by the difficulty of the study of the…
In this paper we present a general procedure for designing higher strong order methods for It\^o stochastic differential equations on matrix Lie groups and illustrate this strategy with two novel schemes that have a strong convergence order…
An error analysis of Runge-Kutta convolution quadrature based on Gauss methods applied to hyperbolic operators is given. The order of convergence relies heavily on the parity of the number of stages, a more favourable situation arising for…
We deal with optimal approximation of solutions of ODEs under local Lipschitz condition and inexact discrete information about the right-hand side functions. We show that the randomized two-stage Runge-Kutta scheme is the optimal method…
Mixed-precision algorithms combine low- and high-precision computations in order to benefit from the performance gains of reduced-precision without sacrificing accuracy. In this work, we design mixed-precision Runge-Kutta-Chebyshev (RKC)…
In this paper we derive and analyze the properties of explicit singly diagonal implicit Runge-Kutta (ESDIRK) integration methods. We discuss the principles for construction of Runge-Kutta methods with embedded methods of different order for…
In this work, we introduce high-order Basis-Update & Galerkin (BUG) integrators based on explicit Runge-Kutta methods for large-scale matrix differential equations. These dynamical low-rank integrators extend the BUG integrator to arbitrary…
Stochastic Hamiltonian partial differential equations, which possess the multi-symplectic conservation law, are an important and fairly large class of systems. The multi-symplectic methods inheriting the geometric features of stochastic…
Obtaining exact solutions to the Schr\"odinger equation in complex quantum systems poses significant challenges. In this context, numerical methods emerge as valuable tools for analyzing such systems. This article proposes a numerical…
We consider high order, implicit Runge-Kutta schemes to solve time-dependent stiff PDEs on dynamically adapted grids generated by multiresolution analysis for unsteady problems disclosing localized fronts. The multiresolution finite volume…
The nonlinear gyrokinetic equations describe plasma turbulence in laboratory and astrophysical plasmas. To solve these equations, massively parallel codes have been developed and run on present-day supercomputers. This paper describes…
Many time-dependent partial differential equations (PDEs) can be transformed into an ordinary differential equations (ODEs) containing moderately stiff and non-stiff terms after spatial semi-discretization. In the present paper, we…
Symplectic partitioned Runge--Kutta methods can be obtained from a variational formulation where all the terms in the discrete Lagrangian are treated with the same quadrature formula. We construct a family of symplectic methods allowing the…
Fractional-step methods are a popular and powerful divide-and-conquer approach for the numerical solution of differential equations. When the integrators of the fractional steps are Runge--Kutta methods, such methods can be written as…
This study computes the gradient of a function of numerical solutions of ordinary differential equations (ODEs) with respect to the initial condition. The adjoint method computes the gradient approximately by solving the corresponding…
A convergence theorem for the continuous weak approximation of the solution of stochastic differential equations by general one step methods is proved, which is an extension of a theorem due to Milstein. As an application, uniform second…
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…