Related papers: Stabilized explicit Adams-type methods
We further develop a simple modification of Runge--Kutta methods that guarantees conservation or stability with respect to any inner-product norm. The modified methods can be explicit and retain the accuracy and stability properties of the…
In order to be convergent, linear multistep methods must be zero stable. While constant step size theory was established in the 1950's, zero stability on nonuniform grids is less well understood. Here we investigate zero stability on…
Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global…
In this article, we design and analyze an arbitrary-order stabilized finite element method to approximate the unique continuation problem for laminar steady flow described by the linearized incompressible Navier--Stokes equation. We derive…
This work establishes a rigorous connection between stability properties of discrete-time algorithms (DTAs) and corresponding continuous-time dynamical systems derived through $ O(s^r) $-resolution ordinary differential equations (ODEs). We…
A new explicit stochastic scheme of order 1 is proposed for solving commutative stochastic differential equations (SDEs) with non-globally Lipschitz continuous coefficients. The proposed method is a semi-tamed version of Milstein scheme to…
Stochastic nonconvex minimax problems have attracted wide attention in machine learning, signal processing and many other fields in recent years. In this paper, we propose an accelerated first-order regularized momentum descent ascent…
High order strong stability preserving (SSP) time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs. Over the past decade…
We revisit the classical stability versus accuracy dilemma for the lattice Boltzmann methods (LBM). Our goal is a stable method of second-order accuracy for fluid dynamics based on the lattice Bhatnager--Gross--Krook method (LBGK). The LBGK…
In this paper, we provide a simple framework to derive and analyse several classes of effective one-step methods. The framework consists in the discretization of a local Fourier expansion of the continuous problem. Different choices of the…
This paper deals with the convergence time analysis of a class of fixed-time stable systems with the aim to provide a new non-conservative upper bound for its settling time. Our contribution is fourfold. First, we revisit the well-known…
This paper presents the first sufficient conditions that guarantee the stability and almost sure convergence of multi-timescale stochastic approximation (SA) iterates. It extends the existing results on one-timescale and two-timescale SA…
Exponential stability of modified truncated Euler-Maruyama method for stochastic differential equations are investigated in this paper. Sufficient conditions for the $p$-th moment and almost sure exponential stability of the given numerical…
We consider a finite element method with symmetric stabilisation for the discretisation of the transient convection--diffusion equation. For the time-discretisation we consider either the second order backwards differentiation formula or…
This paper analyzes the stability of the class of Time-Accurate and Highly-Stable Explicit Runge-Kutta (TASE-RK) methods, introduced in 2021 by Bassenne et al. (J. Comput. Phys.) for the numerical solution of stiff Initial Value Problems…
We consider risk-averse convex stochastic programs expressed in terms of extended polyhedral risk measures. We derive computable confidence intervals on the optimal value of such stochastic programs using the Robust Stochastic Approximation…
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…
Starting from an A-stable rational approximation to $\rm{e}^z$ of order $p$, $$r(z)= 1+ z+ \cdots + z^p/ p! + O(z^{p+1}),$$ families of stable methods are proposed to time discretize abstract IVP's of the type $u'(t) = A u(t) + f(t)$. These…
We propose a quantitative direct method to prove the local stability of a stationary solution for a rough differential equation and its regular discretization scheme. Using Doss-Sussmann technique and stopping time analysis, we provide…
In this paper, we study distributed optimization with smooth non-convex local objectives. We propose a novel variant of the well-known EXact firsT-ordeR Algorithm (EXTRA), called Two-timescale EXTRA, by introducing two distinct step-sizes.…