To capture and simulate geometric surface evolutions, one effective approach is based on the phase field methods. Among them, it is important to design and analyze numerical approximations whose error bound depends on the inverse of the diffuse interface thickness (denoted by $\frac 1ε$) polynomially. However, it has been a long-standing problem whether such numerical error bound exists for stochastic phase field equations. In this paper, we utilize the regularization effect of noise to show that near sharp interface limit, there always exists the weak error bound of numerical approximations, which depends on $\frac 1ε$ at most polynomially. To illustrate our strategy, we propose a polynomial taming fully discrete scheme and present novel numerical error bounds under various metrics. Our method of proof could be also extended to a number of other fully numerical approximations for semilinear stochastic partial differential equations (SPDEs).
Sharp $H^1$-norm error estimates of two time-stepping schemes for reaction-subdiffusion problems
Henan University of Economics and Law(河南财经政法大学);Nanjing University of Aeronautics and Astronautics(南京航空航天大学);Beijing Computational Science Research Center(北京计算科学研究中心);Wayne State University(韦恩州立大学)
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
Mathematical Institute, Oxford University(牛津大学数学研究所);Computational Mathematics Group, STFC-Rutherford Appleton Laboratory(STFC-拉瑟福德苹果顿实验室计算数学组);Namur Center for Complex Systems (naXys), University of Namur(纳慕尔复杂系统中心(naXys),纳慕尔大学)