C M. Computational study of fast methods for the Eikonal equations

Abstract. A computational study of the fast marching and the fast sweeping methods for the eikonal equation is given. It is stressed that both algorithms should be considered as “direct ” (as opposed to iterative) methods. On realistic grids, fast sweeping is faster than fast marching for problems with simple geometry. For strongly nonuniform problems and/or complex geometry, the situation may be reversed. Finally, fully second order generalizations of methods of this type for problems with obstacles are proposed and implemented. Key words. Hamilton–Jacobi, eikonal, viscosity solution, fast marching, fast sweepin