Sparse-Grid Implementation of Fixed-Point Fast Sweeping WENO Schemes for Eikonal Equations
Zachary M. Miksis, Yong-Tao Zhang
Sparse-Grid Implementation of Fixed-Point Fast Sweeping WENO Schemes for Eikonal Equations
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 [
Fixed-point fast sweeping methods / Weighted essentially non-oscillatory (WENO) schemes / Sparse grids / Static Hamilton-Jacobi (H - J) equations / Eikonal equations
[1.] |
|
[2.] |
|
[3.] |
|
[4.] |
|
[5.] |
Chew, L.P., Drysdale, R.L.: Voronoi diagrams based on convex distance functions. In: SCG ’85: Proceedings of the First Annual Symposium and Computational Geometry, New York, NY, Association for Computing Machinery, pp. 235–244 (1985)
|
[6.] |
|
[7.] |
|
[8.] |
|
[9.] |
|
[10.] |
Garcke, J.: Sparse grids in a nutshell. In: Garcke, J., Griebel, M. (eds) Sparse Grids and Applications, Lecture Notes in Computational Science and Engineering, vol. 88, pp. 57–80. Springer, New York (2013)
|
[11.] |
|
[12.] |
|
[13.] |
|
[14.] |
|
[15.] |
|
[16.] |
|
[17.] |
|
[18.] |
|
[19.] |
|
[20.] |
|
[21.] |
|
[22.] |
|
[23.] |
Nishida, T., Sugihara, K.: Voronoi diagram in a flow field. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation, ISAAC 2003 Lecture Notes in Computer Science, vol. 2906, pp. 26–35. Berlin, Springer (2003)
|
[24.] |
|
[25.] |
|
[26.] |
|
[27.] |
|
[28.] |
|
[29.] |
|
[30.] |
|
[31.] |
|
[32.] |
|
[33.] |
|
[34.] |
|
[35.] |
Shu, C.-W.: Essentially non-oscillatory and weighted essentially non-oscillatory schemes for hyperbolic conservation laws. In: Quarteroni, A. (ed) Advanced Numerical Approximation of Nonlinear Hyperbolic Equations, Lecture Notes in Mathematics, vol. 1697, pp. 325–432. Springer-Verlag, New York (1998)
|
[36.] |
|
[37.] |
|
[38.] |
|
[39.] |
Zenger, C.: Sparse grids. In: Hackbusch, W. (ed) Notes on Numerical Fluid Mechanics, vol. 31, pp. 241–251. Vieweg, Braunschweig (1991)
|
[40.] |
|
[41.] |
|
[42.] |
|
[43.] |
|
[44.] |
|
[45.] |
|
/
〈 | 〉 |