- Journal Home
- Volume 43 - 2025
- Volume 42 - 2024
- Volume 41 - 2023
- Volume 40 - 2022
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
Cited by
- BibTex
- RIS
- TXT
High order fast sweeping methods have been developed recently in the literature to solve static Hamilton-Jacobi equations efficiently. Comparing with the first order fast sweeping methods, the high order fast sweeping methods are more accurate, but they often require additional numerical boundary treatment for several grid points near the boundary because of the wider numerical stencil. It is particularly important to treat the points near the inflow boundary accurately, as the information would flow into the computational domain and would affect global accuracy. In the literature, the numerical solution at these boundary points are either fixed with the exact solution, which is not always feasible, or computed with a first order discretization, which could reduce the global accuracy. In this paper, we discuss two strategies to handle the inflow boundary conditions. One is based on the numerical solutions of a first order fast sweeping method with several different mesh sizes near the boundary and a Richardson extrapolation, the other is based on a Lax-Wendroff type procedure to repeatedly utilizing the PDE to write the normal spatial derivatives to the inflow boundary in terms of the tangential derivatives, thereby obtaining high order solution values at the grid points near the inflow boundary. We explore these two approaches using the fast sweeping high order WENO scheme in [18] for solving the static Eikonal equation as a representative example. Numerical examples are given to demonstrate the performance of these two approaches.
}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8629.html} }High order fast sweeping methods have been developed recently in the literature to solve static Hamilton-Jacobi equations efficiently. Comparing with the first order fast sweeping methods, the high order fast sweeping methods are more accurate, but they often require additional numerical boundary treatment for several grid points near the boundary because of the wider numerical stencil. It is particularly important to treat the points near the inflow boundary accurately, as the information would flow into the computational domain and would affect global accuracy. In the literature, the numerical solution at these boundary points are either fixed with the exact solution, which is not always feasible, or computed with a first order discretization, which could reduce the global accuracy. In this paper, we discuss two strategies to handle the inflow boundary conditions. One is based on the numerical solutions of a first order fast sweeping method with several different mesh sizes near the boundary and a Richardson extrapolation, the other is based on a Lax-Wendroff type procedure to repeatedly utilizing the PDE to write the normal spatial derivatives to the inflow boundary in terms of the tangential derivatives, thereby obtaining high order solution values at the grid points near the inflow boundary. We explore these two approaches using the fast sweeping high order WENO scheme in [18] for solving the static Eikonal equation as a representative example. Numerical examples are given to demonstrate the performance of these two approaches.