首页|Numerical attractors and approximations for stochastic or deterministic sine-Gordon lattice equations
Numerical attractors and approximations for stochastic or deterministic sine-Gordon lattice equations
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
First, we apply the implicit Euler scheme to discretize the sine-Gordon lattice equation (possessing a global attractor) and prove the existence of a numerical attractor for the time-discrete sine-Gordon lattice system with small step sizes. Second, we establish the upper semi-convergence from the numerical attractor towards the global attractor when the step size tends to zero. Third, we establish the upper semi-convergence from the random attractor of the stochastic sine-Gordon lattice equation to the global attractor when the intensity of noise goes to zero. Fourth, we show the finitely dimensional approximations of the three (numerical, random and global) attractors as the dimension of the state space goes to infinity. In a word, we establish four paths of convergence of finitely dimensional (numerical and random) attractors towards the global attractor. (C) 2021 Elsevier Inc. All rights reserved.
NSTL
Elsevier
