Sparse grid implementation of a fixed-point fast sweeping WENO scheme for Eikonal equations
Zachary M. Miksis, Yong-Tao Zhang

TL;DR
This paper introduces a sparse grid approach to a fixed-point fast sweeping WENO scheme, significantly reducing computational costs for multidimensional Eikonal equations while maintaining high accuracy.
Contribution
The paper applies sparse grid techniques to a fixed-point fast sweeping WENO scheme, enhancing efficiency for solving multidimensional Eikonal equations.
Findings
Achieves large CPU time savings on refined meshes
Maintains comparable accuracy and resolution to regular grids
Demonstrates effectiveness on multidimensional Eikonal and Hamilton-Jacobi equations
Abstract
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 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 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods for differential equations · Advanced Numerical Methods in Computational Mathematics · Matrix Theory and Algorithms
