Fast two-scale methods for Eikonal equations

SIAM Journal on Scientific Computing

Volumn 34, Issue 2, 2012, Pages

  Chacon, Adam ^a   Vladimirsky, Alexander ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Cell decomposition; Eikonal PDEs; Fast Marching Method; Fast Sweeping Method; Label correcting; Label setting

Indexed keywords

DIFFERENTIAL EQUATIONS; GEOMETRICAL OPTICS;

CELL DECOMPOSITION; COMPLICATED GEOMETRY; EIKONAL EQUATION; EIKONAL PDES; FAST MARCHING METHODS; FAST SWEEPING METHOD; FAST-MARCHING; LABEL SETTINGS; LABEL-CORRECTING; TWO-SCALE METHODS;

NUMERICAL METHODS;

EID: 84861402963     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/10080909X     Document Type: Article

References (52)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice-Hall, Upper Saddle River, NJ, 1993.
2. K. Alton and I. M. Mitchell, Fast marching methods for stationary Hamilton-Jacobi equations with axis-aligned anisotropy, SIAM J. Numer. Anal., 47 (2008), pp. 363-385.
3. S. Bak, J. McLaughlin, and D. Renzi, Some improvements for the fast sweeping method, SIAM J. Sci. Comput., 32 (2010).
4. M. Bardi and I. Capuzzo Dolcetta, Optimal Control and Viscosity Solutions of Hamilton- Jacobi-Bellman Equations, Birkhäuser Boston, Boston, MA, 1997.
5. G. Barles and P. E. Souganidis, Convergence of approximation schemes for fully nonlinear second order equations, Asymptot. Anal., 4 (1991), pp. 271-283.
6. R. Bellman, Dynamic Programming, Princeton University Press, Princeton, NJ, 1957.
7. D. P.Bertsekas, A simple and fast label correcting algorithm for shortest paths, Networks, 23 (1993), pp. 703-709.
8. D. P. Bertsekas, Network Optimization: Continuous & Discrete Models, Athena Scientific, Boston, MA, 1998.
9. D. P. Bertsekas, Dynamic Programming and Optimal Control, vol. I and II, 2nd ed., Athena Scientific, Boston, MA, 2001.
10. D. P. Bertsekas, F. Guerriero, and R. Musmanno, Parallel asynchronous label correcting methods for shortest paths, J. Optim. Theory Appl., 88 (1996), pp. 297-320.
11. F. Bornemann and C. Rasch, Finite-element discretization of static Hamilton-Jacobi equations based on a local variational principle, Comput. Vis. Sci., 9 (2006), pp. 57-69. (Pubitemid 44078307)
12. M. Boué and P. Dupuis, Markov chain approximations for deterministic control problems with affine dynamics and quadratic cost in the control, SIAM J. Numer. Anal., 36 (1999), pp. 667-695. (Pubitemid 129569406)
13. A. Chacon and A. Vladimirsky, Fast Two-Scale Methods for Eikonal Equations, Technical report, http://arxiv.org/abs/1110.6220.
14. M. G. Crandall, L. C. Evans, and P.-L. Lions, Some properties of viscosity solutions of Hamilton-Jacobi equations, Trans. Amer. Math. Sci., 282 (1984), pp. 487-502.
15. M. G. Crandall and P.-L. Lions, Viscosity solutions of Hamilton-Jacobi equations, Trans. Amer. Math. Sci., 277 (1983), pp. 1-43.
16. E. Cristiani and M. Falcone, A characteristics driven fast marching method for the Eikonal equation, in Numerical Mathematics and Advanced Applications, Proceedings of ENUMATH 2007, Graz, Austria, 2007, pp. 695-702.
17. P.-E. Danielsson, Euclidean distance mapping, Comput. Graphics Image Process., 14 (1980), pp. 227-248.
18. R. Dial, Algorithm 360: Shortest path forest with topological ordering, Comm. ACM, (1969), pp. 632-633.
19. E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math., 1 (1959), pp. 269-271.
20. M. Falcone, The minimum time problem and its applications to front propagation, inMotion by Mean Curvature and Related Topics, Proceedings of the International Conference at Trento, 1992, Walter de Gruyter, New York, 1994.
21. F. Glover, R. Glover, and D. Klingman, The threshold shortest path algorithm, Math. Program. Stud., 26 (1986), pp. 12-37.
22. R. Gonzales and E. Rofman, On deterministic control problems: An approximate procedure for the optimal cost, I, the stationary problem, SIAM J. Control Optim., 23 (1985), pp. 242- 266. (Pubitemid 15473328)
23. 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. (Pubitemid 44784217)
24. S.-R. Hysing and S. Turek, The Eikonal equation: Numerical efficiency vs. algorithmic complexity on quadrilateral grids, in Proceedings of ALGORITMY, 2005, pp. 22-31.
25. W.-K. Jeong and R. T. Whitaker, A fast iterative method for Eikonal equations, SIAM J. Sci. Comput., 30 (2008), pp. 2512-2534.
26. C. Y. Kao, S. Osher, and J. Qian, Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations, J. Comput. Phys., 196 (2004), pp. 367-391. (Pubitemid 38521675)
27. C. Y. Kao, S. Osher, and Y. H. Tsai, Fast sweeping methods for static Hamilton-Jacobi equations, SIAM J. Numer. Anal., 42 (2005), pp. 2612-2632. (Pubitemid 41812897)
28. S. Kim, An O(N) level set method for eikonal equations, SIAM J. Sci. Comput., 22 (2001), pp. 2178-2193. (Pubitemid 34050959)
29. R. Kimmel and J. A. Sethian, Fast marching methods on triangulated domains, Proc. Natl. Acad. Sci., 95 (1998), pp. 8341-8435.
30. H. J. Kushner and P. G. Dupuis, Numerical Methods for Stochastic Control Problems in Continuous Time, Academic Press, New York, 1992.
31. F. Li, C.-W. Shu, Y.-T. Zhang, and H.-K. Zhao, A second order DGM based fast sweeping method for Eikonal equations, J. Comput. Phys., 227 (2008), pp. 8191-8208.
32. S. Luo, Y. Yu, and H.-K. Zhao, A new approximation for effective Hamiltonians for homogenization of a class of Hamilton-Jacobi equations, Multiscale Model. Simul., 9 (2011), pp. 711-734.
33. A. M. Oberman, R. Takei, and A. Vladimirsky, Homogenization of metric Hamilton-Jacobi equations, Multiscale Model. Simul., 8 (2009), pp. 269-295.
34. U. Pape, Implementation and efficiency of Moore: Algorithms for the shortest path problem, Math. Program., 7 (1974), pp. 212-222.
35. L. C. Polymenakos, D. P. Bertsekas, and J. N. Tsitsiklis, Implementation of efficient algorithms for globally optimal trajectories, IEEE Trans. Automat. Control, 43 (1998), pp. 278-283. (Pubitemid 128736479)
36. C. Rasch and T. Satzger, Remarks on the O(N) implementation of the fast marching method, IMA J. Numer. Anal., 29 (2009), pp. 806-813.
37. E. Rouy and A. Tourin, A viscosity solutions approach to shape-from-shading, SIAM J. Numer. Anal., 29 (1992), pp. 867-884.
38. J. A. Sethian, A fast marching level set method for monotonically advancing fronts, Proc. Natl. Acad. Sci., 93 (1996), pp. 1591-1595. (Pubitemid 26075170)
39. 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.
40. J. A. Sethian, Fast marching methods, SIAM Rev., 41 (1999), pp. 199-235.
41. J. A. Sethian and A. Vladimirsky, Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes, Proc. Natl. Acad. Sci., 97 (2000), pp. 5699-5703. (Pubitemid 30367460)
42. J. A. Sethian and A. Vladimirsky, Ordered upwind methods for static Hamilton-Jacobi equations, Proc. Natl. Acad. Sci., 98 (2001), pp. 11069-11074. (Pubitemid 32928684)
43. 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.
44. J. A. Sethian and A. Vladimirsky, Ordered upwind methods for hybrid control, in Proceedings of the 5th International Workshop, HSCC 2002, Lecture Notes in Comput. Sci. 2289, Springer, Berlin, 2002.
45. Y.-H.R. Tsai, L.-T. Cheng, S. Osher, and H.-K. Zhao, Fast sweeping algorithms for a class of Hamilton-Jacobi equations, SIAM J. Numer. Anal., 41 (2003), pp. 659-672.
46. J. N. Tsitsiklis, Efficient algorithms for globally optimal trajectories, in Proceedings, IEEE 33rd Conference on Decision and Control, Lake Buena Vista, FL, 1994, pp. 1368-1373.
47. J. N. Tsitsiklis, Efficient algorithms for globally optimal trajectories, IEEE Trans. Automat. Control, 40 (1995), pp. 1528-1538.
48. A. Vladimirsky, Label-setting methods for multimode stochastic shortest path problems on graphs, Math. Oper. Res., 33 (2008), pp. 821-838.
49. O. Weber, Y. Devir, A. Bronstein, M. Bronstein, and R. Kimmel, Parallel algorithms for the approximation of distance maps on parametric surfaces, ACMTrans. Graphics, 27 (2008).
50. L. Yatziv, A. Bartesaghi, and G. Sapiro, O(N) implementation of the fast marching algorithm, J. Comput. Phys., 212 (2006), pp. 393-399. (Pubitemid 41799930)
51. Y.-T. Zhang, S. Chen, F. Li, H.-K. Zhao, and C.-W. Shu, Uniformly accurate discontinuous Galerkin fast sweeping methods for Eikonal equations, SIAM J. Sci. Comput., to appear.
52. H. K. Zhao, Fast sweeping method for Eikonal equations, Math. Comp., 74 (2005), pp. 603-627.