相关论文: A Stiff Order Condition Theory for Runge-Kutta Met…

Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the numerical treatment of differential systems governed by stiff and non-stiff terms. This paper discusses order conditions and symplecticity properties of a class of IMEX…

This paper studies the weak convergence order of the stochastic theta method for stochastic differential equations (SDEs) driven by time-changed L\'{e}vy noise under global Lipschitz and linear growth conditions. In contrast to classical…

This article is devoted to the construction of numerical methods which remain insensitive to the smallness of the semiclassical parameter for the linear Schr{\"o}dinger equation in the semiclassical limit. We specifically analyse the…

A linear evolving surface partial differential equation is first discretized in space by an arbitrary Lagrangian Eulerian (ALE) evolving surface finite element method, and then in time either by a Runge-Kutta method, or by a backward…

It has now become customary in the field of numerical relativity to couple high order finite difference schemes to mesh refinement algorithms. To this end, different modifications to the standard Berger-Oliger adaptive mesh refinement…

The recently-introduced relaxation approach for Runge-Kutta methods can be used to enforce conservation of energy in the integration of Hamiltonian systems. We study the behavior of implicit and explicit relaxation Runge-Kutta methods in…

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…

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…

Relaxation Runge-Kutta methods reproduce a fully discrete dissipation (or conservation) of entropy for entropy stable semi-discretizations of nonlinear conservation laws. In this paper, we derive the discrete adjoint of relaxation…

We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…

Constrained optimization problems where both the objective and constraints may be nonsmooth and nonconvex arise across many learning and data science settings. In this paper, we show for any Lipschitz, weakly convex objectives and…

This work constructs a new class of multirate schemes based on the recently developed generalized additive Runge-Kutta (GARK) methods (Sandu and Guenther, 2013). Multirate schemes use different step sizes for different components and for…

The ODE method has been a workhorse for algorithm design and analysis since the introduction of the stochastic approximation. It is now understood that convergence theory amounts to establishing robustness of Euler approximations for ODEs,…

We study gradient descent (GD) with a constant stepsize for $\ell_2$-regularized logistic regression with linearly separable data. Classical theory suggests small stepsizes to ensure monotonic reduction of the optimization objective,…

We study semilinear elliptic equations \begin{equation*} \begin{cases} -\Delta u = f(u) & \text{in } \Omega, \\ \partial_\nu u = 0 & \text{on } \partial\Omega, \end{cases} \end{equation*} with homogeneous Neumann boundary conditions in…

In a series of papers \cite{LSJR16, PP17, LPP}, it was established that some of the most commonly used first order methods almost surely (under random initializations) and with step-size being small enough, avoid strict saddle points, as…

We study the local discretization error of Patankar-type Runge-Kutta methods applied to semi-discrete PDEs. For a known two-stage Patankar-type scheme the local error in PDE sense for linear advection or diffusion is shown to be of the…

We present fifth order Runge-Kutta-Nystr\"om methods, where we allow the timestep coefficients to assume complex values. Among the methods with complex timesteps, we focus on the ones with the coefficients that have positive real parts.…

For the Landau--Lifshitz--Gilbert (LLG) equation of micromagnetics we study linearly implicit backward difference formula (BDF) time discretizations up to order $5$ combined with higher-order non-conforming finite element space…

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…