Computational Study of Fast Methods For The Eikonal Equation

"A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal equation is given. It is shown that even though Fast Sweeping requires asymptotically less operations than Fast Marching, the latter method is faster than the former for the problems under consideration and for realistic grid sizes. Fully second order generalizations of methods of this type for problems with obstacles are proposed."

• Type: Journal
• Year: 2006
• Where: SIAM Journal of Scientific Computing
• Authors: Pierre A. Gremaud and Christopher M. Kuster
• Keywords: Eikonal Equation, Fast Sweeping Method, Hamilton-Jacobi, Level Set Methods, Viscosity Solution