Related papers: Randomized Runge-Kutta method -- stability and con…
A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal deterministic approximation in each case is straightforward,…
It is shown that for a parabolic problem with maximal $L^p$-regularity (for $1<p<\infty$), the time discretization by a linear multistep method or Runge--Kutta method has maximal $\ell^p$-regularity uniformly in the stepsize if the method…
Implicit-explicit Runge-Kutta (IMEX-RK) schemes are popular methods to treat multiscale equations that contain a stiff part and a non-stiff part, where the stiff part is characterized by a small parameter $\varepsilon$. In this work, we…
We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…
Strong stability preserving (SSP) Runge-Kutta methods are often desired when evolving in time problems that have two components that have very different time scales. Where the SSP property is needed, it has been shown that implicit and…
In this paper, discrete linear quadratic regulator (DLQR) and iterative linear quadratic regulator (ILQR) methods based on high-order Runge-Kutta (RK) discretization are proposed for solving linear and nonlinear quadratic optimal control…
An explicit stabilized additive Runge-Kutta scheme is proposed. The method is based on a splitting of the problem in severely stiff and mildly stiff subproblems, which are then independently solved using a Runge-Kutta-Chebyshev scheme. The…
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…
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…
In this paper, we construct stochastic symplectic Runge--Kutta (SSRK) methods of high strong order for Hamiltonian systems with additive noise. By means of colored rooted tree theory, we combine conditions of mean-square order 1.5 and…
This paper considers the numerical integration of semilinear evolution PDEs using the high order linearly implicit methods developped in a previous paper in the ODE setting. These methods use a collocation Runge--Kutta method as a basis,…
When evolving in time the solution of a hyperbolic partial differential equation, it is often desirable to use high order strong stability preserving (SSP) time discretizations. These time discretizations preserve the monotonicity…
In this paper, we study the minimax optimization problem in the smooth and strongly convex-strongly concave setting when we have access to noisy estimates of gradients. In particular, we first analyze the stochastic Gradient Descent Ascent…
We introduce a novel dynamic learning-rate scheduling scheme grounded in theory with the goal of simplifying the manual and time-consuming tuning of schedules in practice. Our approach is based on estimating the locally-optimal stepsize,…
A posteriori error estimates based on residuals can be used for reliable error control of numerical methods. Here, we consider them in the context of ordinary differential equations and Runge-Kutta methods. In particular, we take the…
In this work, we investigate the regularized solutions and their finite element solutions to the inverse source problems governed by partial differential equations, and establish the stochastic convergence and optimal finite element…
We consider the stability of Robust Optimization problems with respect to perturbations in their uncertainty sets. We focus on Linear Optimization problems, including those with a possibly infinite number of constraints, also known as…
This study focuses on the development and analysis of a group of high-order implicit-explicit (IMEX) Runge--Kutta (RK) methods that are suitable for discretizing gradient flows with nonlinearity that is Lipschitz continuous. We demonstrate…
Numerical integrators could be used to form interpolation conditions when training neural networks to approximate the vector field of an ordinary differential equation (ODE) from data. When numerical one-step schemes such as the Runge-Kutta…
Applied to the master equation, the usual numerical integration methods, such as Runge-Kutta, become inefficient when the rates associated with various transitions differ by several orders of magnitude. We introduce an integration scheme…