A simple bound-preserving sweeping technique for conservative numerical approximations

Yuan Liu Yingda Cheng Chi-Wang Shu Brown University

Numerical Analysis and Scientific Computing mathscidoc:1804.25009

Journal of Scientific Computing, 73, 1028-1071, 2017
In this paper, we propose a simple bound-preserving sweeping procedure for conservative numerical approximations. Conservative schemes are of importance in many applications, yet for high order methods, the numerical solutions do not necessarily satisfy maximum principle. This paper constructs a simple sweeping algorithm to enforce the bound of the solutions. It has a very general framework acting as a postprocessing step accommodating many point-based or cell average-based discretizations. The method is proven to preserve the bounds of the numerical solution while conserving a prescribed quantity designated as a weighted average of values from all points. The technique is demonstrated to work well with a spectral method, high order finite difference and finite volume methods for scalar conservation laws and incompressible flows. Extensive numerical tests in 1D and 2D are provided to verify the accuracy of the sweeping procedure.
No keywords uploaded!
[ Download ] [ 2018-04-16 09:42:16 uploaded by chiwangshu ] [ 643 downloads ] [ 0 comments ]
  title={A simple bound-preserving sweeping technique for conservative numerical approximations},
  author={Yuan Liu, Yingda Cheng, and Chi-Wang Shu},
  booktitle={Journal of Scientific Computing},
Yuan Liu, Yingda Cheng, and Chi-Wang Shu. A simple bound-preserving sweeping technique for conservative numerical approximations. 2017. Vol. 73. In Journal of Scientific Computing. pp.1028-1071. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20180416094216331991044.
Please log in for comment!
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved