Some Improvements for the Fast Sweeping Method

In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapidly. The conventional wisdom is that fast sweeping works best when the speed changes slowly, and fast marching is the algorithm of choice when the speed changes rapidly. The goal here is to achieve run times for the fast sweeping method that are at least as fast, or faster, than competitive methods, e.g. fast marching, in the case where the speed is changing rapidly. The first improvement, which we call the locking method, dynamically keeps track of grid points that have either already had the solution successfully calculated at that grid point or for which the solution cannot be successfully calculated during the current iteration. These locked points can quickly be skipped over during the fast sweeping iterations, avoiding many time-consuming calculations. The second improvement, which we call the two queue method, keeps all of the unlocked points in a data structure so that the locked points no longer need to be visited at all. Unfortunately, it is not possible to insert new points into the data structure while maintaining the fast sweeping ordering without at least occasionally sorting. Instead, we segregate the grid points into those with small predicted solutions and those with large predicted solutions using two queues. We give two ways of performing this segregation. This method is a label correcting (iterative) method like the fast sweeping method, but it tends to operate near the front like the fast marching method. It is reminiscent of the threshold method for finding the shortest path on a network, [F. Glover, D. Klingman, and N. Phillips, Oper. Res., 33 (1985), pp. 65-73]. We demonstrate the numerical efficiency of the improved methods on a number of examples.

[1]  J. A. Sethian,et al.  Fast Marching Methods , 1999, SIAM Rev..

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

[3]  Christopher M. Kuster,et al.  Computational Study of Fast Methods for the Eikonal Equation , 2005, SIAM J. Sci. Comput..

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

[5]  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.

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

[7]  P. Dupuis,et al.  Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control , 1999 .

[8]  Say Song Goh,et al.  Mathematics and Computation in Imaging Science and Information Processing , 2007 .

[9]  Elbridge Gerry Puckett,et al.  Two new methods for simulating photolithography development in 3D , 1997 .

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

[11]  Chi-Wang Shu.  HIGH ORDER NUMERICAL METHODS FOR TIME DEPENDENT HAMILTON-JACOBI EQUATIONS , 2007 .

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

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

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

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

[16]  R. Newcomb.  VISCOSITY SOLUTIONS OF HAMILTON-JACOBI EQUATIONS , 2010 .

[17]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

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

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

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

[21]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[22]  Chi-Wang Shu,et al.  A discontinuous Galerkin finite element method for directly solving the Hamilton-Jacobi equations , 2007, Journal of Computational Physics.

[23]  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.

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

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

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