Some improvements for the fast sweeping method

SIAM Journal on Scientific Computing

Volumn 32, Issue 5, 2010, Pages 2853-2874

  Bak, Stanley ^a   Mclaughlin, Joyce ^b   Renzi, Daniel ^c  

^a 1120 Science and Engineering Offices   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c NONE   (United States)

Author keywords

Eikonal equation; Fast marching; Fast sweeping; Static Hamilton Jacobi equation

Indexed keywords

DATA STRUCTURES; GEOMETRICAL OPTICS; ITERATIVE METHODS; LOCKS (FASTENERS); NUMERICAL METHODS;

'CURRENT; EIKONAL EQUATION; FAST SWEEPING; FAST SWEEPING METHOD; FAST-MARCHING; GRID POINTS; KEEP TRACK OF; RUNTIMES; SPEED CHANGE; STATIC HAMILTON-JACOBI EQUATION;

SPEED;

EID: 78149354082     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/090749645     Document Type: Article

References (27)

1. M. Boue and P. Dupuis, Markov chain approximations for deterministic control problems with affine dynamics and quadratic costs in the control, SIAM J. Numer. Anal., 36 (1999), pp. 667-695.
2. M. G. Crandall and P. L. Lions, Viscosity solutions of Hamilton-Jacobi equations, Trans. Amer. Math. Soc., 277 (1983), pp. 1-42.
3. D Bertsekas, Network Optimization: Continuous and Discrete Models, Athena Scientific, Boston, MA, 1998.
4. Y. Cheng and C.-W. Shu, A discontinuous Galerkin finite element method for directly solving the Hamilton-Jacobi equations, J. Comput. Phys., 223 (2007), pp. 398-415.
5. J. Helmsen, E. G. Puckett, P. Colella, and M. Dorr, Two new methods for simulating photolithography development in 3D, Proc. SPIE, 2736 (1996), pp. 253-261.
6. F. Glover, D. Klingman, and N. Phillips, New polynomial bounded shortest path algorithm, Oper. Res., 33 (1985), pp. 65-73.
7. P. A. Gremaud and C. M. Kuster, Computational study of fast methods for the Eikonal equation, SIAM J. Sci. Comput., 27 (2006), pp. 1803-1816.
8. C. Y. Kao, S. J. Osher, and J. Qian, Lax-Freidrichs sweeping schemes for static Hamilton- Jacobi equations, J. Comput. Phys., 196 (2004), pp. 367-391.
9. C. Y. Kao, S. J. Osher, and Y. H. Tsai, Fast sweeping methods for static Hamilton-Jacobi equations, SIAM J. Numer. Anal., 42 (2005), pp. 2612-2632.
10. S. Kim, An O(N) level set method for Eikonal equations, SIAM J. Sci. Comput., 22 (2001), pp. 2178-2193.
11. R. Kimmel and J. A. Sethian, Fast marching methods on triangulated domains, Proc. Natl. Acad. Sci. USA, 95 (1998), pp. 8341-8435.
12. F. Li, C. W. Shu, Y. T. Zhang, and H. Zhao, A second order discontinuous Galerkin fast sweeping method for Eikonal equations, J. Comput. Phys., 227 (2008), pp. 8191-8208.
13. J. Qian, Y. Zhang, and H. Zhao, A fast sweeping method for static convex Hamilton-Jacobi equations, J. Sci. Comput., 31 (2007), pp. 237-271.
14. J. Qian, Y. Zhang, and H. Zhao, Fast sweeping methods for Eikonal equations on triangular meshes, SIAM J. Numer. Anal., 45 (2007), pp. 83-107.
15. S. J. Osher and R. Fedkiw, Level Set Methods and Dynamic Implicit Surfaces, Springer, New York, 2002.
16. J. A. Sethian, A fast marching level set method for monotonically advancing fronts, Proc. Natl. Acad. Sci. USA, 93 (1996), pp. 1591-1595.
17. J. A. Sethian, Fast marching methods, SIAM Rev., 41 (1999), pp. 199-235.
18. J. A. Sethian, Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision and Materials Sciences, Cambridge University Press, Cambridge, UK, 1996.
19. J. A. Sethian and A. Vladimirsky, Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes, Proc. Natl. Acad. Sci. USA, 97 (2000), pp. 5699-5703.
20. J. A. Sethian and A. Vladimirsky, Ordered upwind methods for static Hamilton-Jacobi equations: Theory and algorithms, SIAM J. Numer. Anal., 41 (2003), pp. 325-363.
21. C. W. Shu, High Order Numerical Methods for Time Dependent Hamilton-Jacobi Equations, in Mathematics and Computation in Imaging Science and Information Processing, Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap. 11, S. S. Hoh, A. Ron, and Z. Shen, eds., World Scientific, Singapore, 2007, pp. 47-91.
22. R. Tsai, L. T. Cheng, S. J. Osher, and H. K. Zhao, Fast sweeping algorithms for a class of Hamilton-Jacobi equations, SIAM J. Numer. Anal., 41 (2003), pp. 673-1594
23. J. N. Tsitsiklis, Efficient algorithms for globally optimal trajectories, IEEE Trans. Automat. Control., 40 (1995), pp. 1528-1538.
24. L. Yatziv, A. Bartesaghi, and G. Sapiro, O(N) implementation of the fast marching algorithm, J. Comput. Phys., 212 (2005), pp. 393-399.
25. Y. Zhang, H. Zhao, and S. Chen, Fixed-point iterative sweeping methods for static Hamilton- Jacobi equations, Methods Appl. Anal., 13 (2006), pp. 299-320.
26. Y.-T. Zhang, H.-K. Zhao, and J. Qian, High order fast sweeping methods for static Hamilton- Jacobi equations, J. Sci. Comput., 29 (2006), pp. 25-56.
27. H. Zhao, A fast sweeping method for Eikonal equations, Math. Comp., 74 (2004), pp. 603-627.