Sparse-Grid Implementation of Fixed-Point Fast Sweeping WENO Schemes for Eikonal Equations

创建日期:  2024/04/07     浏览次数:   返回

刊名:《应用数学与计算数学学报(英文)》 2024年第1期,第3-29页

题名:Sparse-Grid Implementation of Fixed-Point Fast Sweeping WENO Schemes for Eikonal Equations

作者:Zachary M. Miksis · Yong-Tao Zhang

单位:Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN 46556, USA

摘要: Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady-state solutions of hyperbolic partial differential equations (PDEs). As other types of fast sweeping schemes, fixed-point fast sweeping methods use the Gauss-Seidel iterations and alternating sweeping strategy to cover characteristics of hyperbolic PDEs in a certain direction simultaneously in each sweeping order. The resulting iterative schemes have a fast convergence rate to steady-state solutions. Moreover, an advantage of fixed-point fast sweeping methods over other types of fast sweeping methods is that they are explicit and do not involve the inverse operation of any nonlinear local system. Hence, they are robust and flexible, and have been combined with high-order accurate weighted essentially non-oscillatory (WENO) schemes to solve various hyperbolic PDEs in the literature. For multidimensional nonlinear problems, high-order fixed-point fast sweeping WENO methods still require quite a large amount of computational costs. In this technical note, we apply sparse-grid techniques, an effective approximation tool for multidimensional problems, to fixed-point fast sweeping WENO methods for reducing their computational costs. Here, we focus on fixed-point fast sweeping WENO schemes with third-order accuracy (Zhang et al. 2006 [ 41 ]), for solving Eikonal equations, an important class of static Hamilton-Jacobi (H-J) equations. Numerical experiments on solving multidimensional Eikonal equations and a more general static H-J equation are performed to show that the sparse-grid computations of the fixed-point fast sweeping WENO schemes achieve large savings of CPU times on refined meshes, and at the same time maintain comparable accuracy and resolution with those on corresponding regular single grids.

关键词:Fixed-point fast sweeping methods; Weighted essentially non-oscillatory (WENO) schemes; Sparse grids; Static Hamilton-Jacobi (H-J) equations; Eikonal equations

全文链接:https://link.springer.com/article/10.1007/s42967-022-00209-x

上一条:A data‑driven approach to RUL prediction of tools

下一条:论从史出:中国电影史研究的理论问题再探

 版权所有 © 上海大学   沪ICP备09014157   沪公网安备31009102000049号  地址:上海市宝山区上大路99号    邮编:200444   电话查询
 技术支持:上海大学信息化工作办公室   联系我们  

办公地址:上海市宝山区南陈路333号上海大学东区三号楼二楼   联系电话:021-66132736