Pith. sign in

REVIEW

Strong convergence rates for explicit space-time discrete numerical approximations of stochastic Allen-Cahn equations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.02423 v1 pith:G375O2SY submitted 2017-11-07 math.PR cs.NAmath.NA

Strong convergence rates for explicit space-time discrete numerical approximations of stochastic Allen-Cahn equations

classification math.PR cs.NAmath.NA
keywords convergenceratesstrongnumericalapproximationsequationsstochasticallen-cahn
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The scientific literature contains a number of numerical approximation results for stochastic partial differential equations (SPDEs) with superlinearly growing nonlinearities but, to the best of our knowledge, none of them prove strong or weak convergence rates for full-discrete numerical approximations of space-time white noise driven SPDEs with superlinearly growing nonlinearities. In particular, in the scientific literature there exists neither a result which proves strong convergence rates nor a result which proves weak convergence rates for full-discrete numerical approximations of stochastic Allen-Cahn equations. In this article we bridge this gap and establish strong convergence rates for full-discrete numerical approximations of space-time white noise driven SPDEs with superlinearly growing nonlinearities such as stochastic Allen-Cahn equations. Moreover, we also establish lower bounds for strong temporal and spatial approximation errors which demonstrate that our strong convergence rates are essentially sharp and can, in general, not be improved.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.