Related papers: Sharp error analysis for averaging Crank-Nicolson …
Adaptive second-order Crank-Nicolson time-stepping methods using the recent scalar auxiliary variable (SAV) approach are developed for the time-fractional Molecular Beam Epitaxial models with Caputo's derivative. Based on the piecewise…
The Crank-Nicolson (short for C-N) scheme for solving {\it backward stochastic differential equation} (BSDE), driven by Brownian motions, was first developed by the authors W. Zhao, L. Chen and S. Peng [SIAM J. Sci. Comput., 28 (2006),…
Numerous error estimates have been carried out on various numerical schemes for subdiffusion equations. Unfortunately most error bounds suffer from a factor $1/(1-\alpha)$ or $\Gamma(1-\alpha)$, which blows up as the fractional order…
Anomalous diffusion is often modelled in terms of the subdiffusion equation, which can involve a weakly singular source term. For this case, many predominant time stepping methods, including the correction of high-order BDF schemes [{\sc…
A linear dispersive mechanism for error focusing in polychromatic solutions is identified. This local error pile-up corresponds to the existence of spurious caustics, which are allowed by the dispersive nature of the numerical error. From…
The aim of this paper is to develop a refined error estimate of L1/finite element scheme for a reaction-subdiffusion equation with constant delay $\tau$ and uniform time mesh. Under the non-uniform multi-singularity assumption of exact…
This work investigates the optimal error estimate of the fully discrete scheme for the variable-exponent subdiffusion model under the nonuniform temporal mesh. We apply the perturbation method to reformulate the original model into its…
Recently, distributed dual averaging has received increasing attention due to its superiority in handling constraints and dynamic networks in multiagent optimization. However, all distributed dual averaging methods reported so far…
We develop a numerical scheme for subdiffusion of variable exponent by combining the $L2-1_\sigma$ temporal discretization with finite element spatial approximation. In existing works, determining the superconvergence points requires…
Since the first optimality proofs for adaptive mesh refinement algorithms in the early 2000s, the theory of optimal mesh refinement for PDEs was inherently limited to stationary problems. The reason for this is that time-dependent problems…
In this paper, we introduce a conservative Crank-Nicolson-type finite difference schemes for the regularized logarithmic Schr\"{o}dinger equation (RLSE) with Dirac delta potential in 1D. The regularized logarithmic Schr\"{o}dinger equation…
Various bias-correction methods such as EXTRA, gradient tracking methods, and exact diffusion have been proposed recently to solve distributed {\em deterministic} optimization problems. These methods employ constant step-sizes and converge…
We derive optimal order a posteriori error estimates for fully discrete approximations of linear Schr\"odinger-type equations, in the $L^\infty(L^2)-$norm. For the discretization in time we use the Crank-Nicolson method, while for the space…
In this paper we consider a sub-diffusion problem where the fractional time derivative is approximated either by the L1 scheme or by Convolution Quadrature. We propose new interpretations of the numerical schemes which lead to a posteriori…
In this paper we focus on the subdiffusive Black Scholes model. The main part of our work consists of the finite difference method as a numerical approach to the option pricing in the considered model. We derive the governing fractional…
We are interested in the kernel of one-dimensional diffusion equations with continuous coefficients as evaluated by means of explicit discretization schemes of uniform step $h>0$ in the limit as $h\to0$. We consider both semidiscrete…
A time-stepping L1 scheme for subdiffusion equation with a Riemann--Liouville time-fractional derivative is developed and analyzed. This is the first paper to show that the L1 scheme for the model problem under consideration is second-order…
We prove the optimal strong convergence rate of a fully discrete scheme, based on a splitting approach, for a stochastic nonlinear Schr\"odinger (NLS) equation. The main novelty of our method lies on the uniform a priori estimate and…
Stability and convergence of a time-weighted discrete scheme with nonuniform time steps are established for linear reaction-subdiffusion equations. The Caupto derivative is approximated at an offset point by using linear and quadratic…
The $k$-Means clustering problem on $n$ points is NP-Hard for any dimension $d\ge 2$, however, for the 1D case there exists exact polynomial time algorithms. Previous literature reported an $O(kn^2)$ time dynamic programming algorithm that…