Related papers: Contractivity of Runge-Kutta methods for convex gr…

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…

This paper investigates the competitiveness of semi-implicit Runge-Kutta (RK) and spectral deferred correction (SDC) time-integration methods up to order six for incompressible Navier-Stokes problems in conjunction with a high-order…

We present unconditionally energy stable Runge-Kutta (RK) discontinuous Galerkin (DG) schemes for solving a class of fourth order gradient flows. Our algorithm is geared toward arbitrarily high order approximations in both space and time,…

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…

We study the gradient method under the assumption that an additively inexact gradient is available for, generally speaking, non-convex problems. The non-convexity of the objective function, as well as the use of an inexactness specified…

A dynamical system is called contractive if any two solutions approach one another at an exponential rate. More precisely, the dynamics contracts lines at an exponential rate. This property implies highly ordered asymptotic behavior…

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…

Motivated by studies on fully discrete numerical schemes for linear hyperbolic conservation laws, we present a framework on analyzing the strong stability of explicit Runge-Kutta (RK) time discretizations for semi-negative autonomous linear…

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…

In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the smooth part of the objective function has Lipschitz…

We identify and analyze a fundamental limitation of the classical projected subgradient method in nonsmooth convex optimization: the inevitable failure caused by the absence of valid subgradients at boundary points. We show that, under…

Finite differences and Runge-Kutta time stepping schemes used in Computational AeroAcoustics simulations are often optimized for low dispersion and dissipation (e.g. DRP or LDDRK schemes) when applied to linear problems in order to…

In this paper, we propose first-order feasible methods for difference-of-convex (DC) programs with smooth inequality and simple geometric constraints. Our strategy for maintaining feasibility of the iterates is based on a "retraction" idea…

For the approximation of solutions for It\^o and Stratonovich stochastic differential equations (SDEs)a new class of efficient stochastic Runge-Kutta (SRK) methods is developed. As the main novelty only two stages are necessary for the…

In this paper we discuss the use of implicit Runge-Kutta schemes for the time discretization of optimal control problems with evolution equations. The specialty of the considered discretizations is that the discretizations schemes for the…

A time discretization method is called strongly stable, if the norm of its numerical solution is nonincreasing. It is known that, even for linear semi-negative problems, many explicit Runge--Kutta (RK) methods fail to preserve this…

Many important differential equations model quantities whose value must remain positive or stay in some bounded interval. These bounds may not be preserved when the model is solved numerically. We propose to ensure positivity or other…

Runge-Kutta (RK) methods may exhibit order reduction when applied to certain stiff problems. While fully implicit RK schemes exist that avoid order reduction via high-stage order, DIRK (diagonally implicit Runge-Kutta) schemes are…

We develop two new sets of stable, rank-adaptive Dynamically Orthogonal Runge-Kutta (DORK) schemes that capture the high-order curvature of the nonlinear low-rank manifold. The DORK schemes asymptotically approximate the truncated singular…

We study Runge-Kutta methods for rough differential equations which can be used to calculate solutions to stochastic differential equations driven by processes that are rougher than a Brownian motion. We use a Taylor series representation…