Computational uncertainty and optimal grid size and time step of the Lax–Friedrichs scheme for the 1D advection equation
Computational uncertainty and optimal grid size and time step of the Lax–Friedrichs scheme for the 1D advection equation
复制标题
DOI：
10.1016/j.aosl.2023.100331
复制
发表时间：
--
影响因子：
2.3
通讯作者：
Yanjie Li
中科院分区：
文献类型：
--
作者：
Jing Cao;Jianping Li;Yanjie Li
This paper examines truncation and round-off errors in the numerical solution of the 1D advection equation with the Lax–Friedrichs scheme, and accumulation of the errors as they are propagated to high temporal layers. The authors obtain a new theoretical approximation formula for the upper bound of the total error of the numerical solution, as well as theoretical formulae for the optimal grid size and time step. The reliability of the obtained formulae is demonstrated with numerical experimental examples. Next, the ratio of the optimal time steps under two different machine precisions is found to satisfy a universal relation that depends only on the machine precision involved. Finally, theoretical verification suggests that this problem satisfies the computational uncertainty principle when the grid ratio is fixed, demonstrating the inevitable existence of an optimal time step size under a finite machine precision.
