A fast sweeping method for Eikonal equations

In this paper a fast sweeping method for computing the numerical solution of Eikonal equations on a rectangular grid is presented. The method is an iterative method which uses upwind difference for discretization and uses Gauss-Seidel iterations with alternating sweeping ordering to solve the discretized system. The crucial idea is that each sweeping ordering follows a family of characteristics of the corresponding Eikonal equation in a certain direction simultaneously. The method has an optimal complexity of O(N) for N grid points and is extremely simple to implement in any number of dimensions. Monotonicity and stability properties of the fast sweeping algorithm are proven. Convergence and error estimates of the algorithm for computing the distance function is studied in detail. It is shown that 2 n Gauss-Seidel iterations is enough for the distance function in n dimensions. An estimation of the number of iterations for general Eikonal equations is also studied. Numerical examples are used to verify the analysis.

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

[2]  E. Rouy,et al.  A viscosity solutions approach to shape-from-shading , 1992 .

[3]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[4]  W. D. Evans,et al.  PARTIAL DIFFERENTIAL EQUATIONS , 1941 .

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

[6]  P. Danielsson.  Euclidean distance mapping , 1980 .

[7]  Phillip Colella,et al.  Two new methods for simulating photolithography development in 3D , 1996, Advanced Lithography.

[8]  M. Falcone,et al.  Semi-Lagrangian schemes for Hamilton-Jacobi equations, discrete representation formulae and Godunov methods , 2002 .

[9]  P. Lions,et al.  Two approximations of solutions of Hamilton-Jacobi equations , 1984 .

[10]  Marizio Falcone,et al.  Discrete time high-order schemes for viscosity solutions of Hamilton-Jacobi-Bellman equations , 1994 .

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

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

[13]  S. Osher,et al.  The nonconvex multi-dimensional Riemann problem for Hamilton-Jacobi equations , 1991 .

[14]  C. M. Elliott,et al.  Uniqueness and error analysis for Hamilton-Jacobi equations with discontinuities , 2004 .

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

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

[17]  Y. Tsai.  Rapid and accurate computation of the distance function using grids , 2002 .

[18]  A. Balch,et al.  A dynamic programming approach to first arrival traveltime computation in media with arbitrarily distributed velocities , 1992 .