Searcharxiv⌕ Search

arXiv · 2610.28552

Strong Convergence of Fully Discrete Tamed Euler Approximations for Time-Changed Stochastic Delay Differential Equations

Abstract

We establish the strong convergence of a fully discrete equidistant tamed Euler--Maruyama (ETEM) method for time-changed stochastic delay differential equations (TCSDDEs) with state-dependent $\mathrm{d}t$ drifts. A coupled one-sided condition on the subordinator-driven drift and diffusion allows superlinear coefficients with polynomial growth in both the current and delayed states. For subordinators whose Laplace exponent satisfies $ψ(λ)\geq c_1λ^α$ for all sufficiently large $λ$, with $α\in(0,1)$, we derive strong error bounds in terms of the time step $Δ$ and the subordinator sampling step $δ$, without imposing a relationship between them. Comparing the partitions generated by the exact and approximate inverse subordinators controls the sampling error without introducing a factor proportional to the number of time steps. For coefficients Lipschitz in both time arguments and Lipschitz history, the scheme achieves a strong convergence rate of order $Δ^{α/2}(1+|\logΔ|)^{(1-α)/2}+\sqrt{δ(1+|\logδ|)}$. A terminal lower bound $c(Δ^{α/2}+δ^{1/2})$ for a multiplicative-noise equation with a stable subordinator establishes the sharpness of both polynomial exponents for this Euler scheme. Numerical experiments illustrate convergence for nonautonomous and multidimensional superlinear delay equations, as well as delay equations with low-regularity time dependence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruchun Zuo, Qian Guo. 2026-10-20. Strong Convergence of Fully Discrete Tamed Euler Approximations for Time-Changed Stochastic Delay Differential Equations. https://arxiv.org/abs/2610.28552

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perturbed saddle-point problems in $\mathrm{L}^p$ with non-regular loads

In this work, we develop the continuous and discrete solvability analysis for perturbed saddle-point problems in Banach spaces with forcing terms regularised by means of a projector constructed using the adjoint of a weighted Clément quasi-interpolation. We take as driving example the linearised Poisson--Boltzmann equation (an advection-diffusion-reaction problem) in mixed form. We use perturbation arguments on the continuous and discrete levels and then derive a priori estimates that remain valid when the load that appears on the right-hand side of the "second" equation is in $\mathrm{H}^{-1}$. Further, we show a supercloseness result and {analyse convergence} of an adequate adaptation of Stenberg postprocessing for mixed advection equations with non-regular data. We provide numerical results that illustrate the convergence of the proposed scheme.

math.NA↗

Born-Preconditioned Learning for Iterative Neural PDE Solvers

Simulating high-frequency waves in spatially varying media remains challenging for both classical iterative methods and neural PDE solvers. We propose Neural Preconditioned Born Series (NPBS), a framework for learning iterative neural PDE solvers. Our guiding idea is to use a simple reference preconditioner to help learn a more effective neural preconditioner. Building on the Convergent Born Series (CBS), NPBS feeds a preconditioned residual to a neural network that predicts a solution update. We train the network to reduce the preconditioned residual after each update. The same reference preconditioner is used for the network input and the loss, giving a metric-matched training objective. Experiments on heterogeneous Helmholtz problems show reduced iteration counts across neural architectures and larger gains at higher wavenumbers. Within a Krylov solver, NPBS achieves the lowest wall-clock time in the evaluated solver comparison. The framework also extends naturally to three-dimensional problems. The same metric-matched formulation also improves convergence on convection-diffusion-reaction systems and Newton linear systems for nonlinear PDEs, indicating that NPBS provides a general framework for learning neural preconditioners.

math.NA↗

Flexible GMRES converges in two phases

We derive a sharp upper bound on the residuals produced by the flexible GMRES (FGMRES) method. The bound shows that FGMRES exhibits two phases of convergence depending on the residual tolerance of the inner preconditioner. For small tolerances, the convergence of FGMRES is practically geometric with a constant rate throughout, while for looser tolerances the two-phase behavior becomes more pronounced. We also show that the derived bound cannot be improved and construct an example for which it becomes an equality.

math.NA↗