A Third Order Accurate Fast Marching Method for the Eikonal Equation in Two Dimensions

In this paper, we develop a third order accurate fast marching method for the solution of the eikonal equation in two dimensions. There have been two obstacles to extending the fast marching method to higher orders of accuracy. The first obstacle is that using one-sided difference schemes is unstable for orders of accuracy higher than two. The second obstacle is that the points in the difference stencil are not available when the gradient is closely aligned with the grid. We overcome these obstacles by using a two-dimensional (2D) finite difference approximation to improve stability, and by locally rotating the grid 45 degrees (i.e., using derivatives along the diagonals) to ensure all the points needed in the difference stencil are available. We show that in smooth regions the full difference stencil is used for a suitably small enough grid size and that the difference scheme satisfies the von Neumann stability condition for the linearized eikonal equation. Our method reverts to first order accuracy near caustics without developing oscillations by using a simple switching scheme. The efficiency and high order of the method are demonstrated on a number of 2D test problems.

[1]  S. Osher,et al.  A PDE-Based Fast Local Level Set Method 1 , 1998 .

[2]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[3]  Seongjai Kim,et al.  An O(N) Level Set Method for Eikonal Equations , 2000, SIAM J. Sci. Comput..

[4]  Ron Kimmel,et al.  Fast Marching Methods , 2004 .

[5]  Centro internazionale matematico estivo. Session,et al.  Advanced Numerical Approximation of Nonlinear Hyperbolic Equations , 1998 .

[6]  Chi-Wang Shu,et al.  A second order discontinuous Galerkin fast sweeping method for Eikonal equations , 2008, J. Comput. Phys..

[7]  J. Sethian,et al.  Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Hongkai Zhao,et al.  Fast Sweeping Methods for Eikonal Equations on Triangular Meshes , 2007, SIAM J. Numer. Anal..

[9]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[11]  B. White,et al.  The stochastic caustic , 1984 .

[12]  Stanley Osher,et al.  Fast Sweeping Algorithms for a Class of Hamilton-Jacobi Equations , 2003, SIAM J. Numer. Anal..

[13]  Hongkai Zhao,et al.  A Fast Sweeping Method for Static Convex Hamilton–Jacobi Equations , 2007, J. Sci. Comput..

[14]  M. Bardi,et al.  Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations , 1997 .

[15]  S. Zagatti.  On viscosity solutions of Hamilton-Jacobi equations , 2008 .

[16]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[17]  QianJianliang,et al.  A Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations , 2007 .

[18]  Stanley Osher,et al.  Fast Sweeping Methods for Static Hamilton-Jacobi Equations , 2004, SIAM J. Numer. Anal..

[19]  Hongkai Zhao,et al.  Fixed-point iterative sweeping methods for static hamilton-Jacobi Equations , 2006 .

[20]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[21]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .

[22]  Hongkai Zhao,et al.  High Order Fast Sweeping Methods for Static Hamilton–Jacobi Equations , 2006, J. Sci. Comput..

[23]  Guillermo Sapiro,et al.  O(N) implementation of the fast marching algorithm , 2006, Journal of Computational Physics.

[24]  S. Osher,et al.  Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations , 2004 .

[25]  Hongkai Zhao,et al.  The Fast Sweeping Method , 2007 .

[26]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .

[27]  Stanley Bak,et al.  Some Improvements for the Fast Sweeping Method , 2010, SIAM J. Sci. Comput..

[28]  S. Osher.  A level set formulation for the solution of the Dirichlet problem for Hamilton-Jacobi equations , 1993 .

[29]  Hongkai Zhao,et al.  A fast sweeping method for Eikonal equations , 2004, Math. Comput..

[30]  P. Dupuis,et al.  Markov chain approximations for deterministic control problems with affine dynamics and quadratic cost in the control , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.