Related papers: General Relaxation Methods for Initial-Value Probl…
We show how the error term for the Trapezium Rule can be estimated, by solving an initial value problem using a Runge-Kutta method. The error term can then be added to the Trapezium approximation, yielding a much more accurate result. We…
This paper concerns with a noisy structured low-rank matrix recovery problem which can be modeled as a structured rank minimization problem. We reformulate this problem as a mathematical program with a generalized complementarity constraint…
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…
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…
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…
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)…
Many problems in science and engineering require an efficient numerical approximation of integrals or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant discretization is often inadvisable as it…
This paper presents a class of Two-Step General Linear Methods for the numerical solution of Retarded Functional Differential Equations. Explicit methods up to order five are constructed. To avoid order reduction for mildly stiff problems…
This paper presents a class of Two-Step General Linear Methods for the numerical solution of Retarded Functional Differential Equations. Explicit methods up to order five are constructed. To avoid order reduction for mildly stiff problems…
Iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for large-scale linear systems. The relaxation method, or Motzkin's method, can be viewed as an iterative method that…
We consider the problem of designing efficient regularization algorithms when regularization is encoded by a (strongly) convex functional. Unlike classical penalization methods based on a relaxation approach, we propose an iterative method…
The aim of this paper is to design the explicit radial basis function (RBF) Runge-Kutta methods for the initial value problem. We construct the two-, three- and four-stage RBF Runge-Kutta methods based on the Gaussian RBF Euler method with…
A new approach for the construction of high order A-stable explicit integrators for ordinary differential equations (ODEs) is theoretically studied. Basically, the integrators are obtained by splitting, at each time step, the solution of…
This paper illuminates the derivation, the applicability, and the efficiency of the Multiplicative Runge-Kutta Method, derived in the frame- work of geometric multiplicative calculus. The removal of the restrictions of geometric…
The main theoretical obstacle to establish the original energy dissipation laws of Runge-Kutta methods for phase-field equations is to verify the maximum norm boundedness of the stage solutions without assuming global Lipschitz continuity…
In this paper we consider the development of Implicit-Explicit (IMEX) Runge-Kutta schemes for hyperbolic systems with multiscale relaxation. In such systems the scaling depends on an additional parameter which modifies the nature of the…
We are interested in high-order linear multistep schemes for time discretization of adjoint equations arising within optimal control problems. First we consider optimal control problems for ordinary differential equations and show loss of…
We combine Patankar-type methods with suitable relaxation procedures that are capable of ensuring correct dissipation or conservation of functionals such as entropy or energy while producing unconditionally positive and conservative…
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 present a framework to construct general stochastic Runge-Kutta Lawson schemes. We prove that the schemes inherit the consistency and convergence properties of the underlying Runge-Kutta scheme, and confirm this in some…