Fast methods for the Eikonal and related Hamilton–Jacobi equations on unstructured meshes
JA Sethian, A Vladimirsky - Proceedings of the National …, 2000 - National Acad Sciences
JA Sethian, A Vladimirsky
Proceedings of the National Academy of Sciences, 2000•National Acad SciencesThe Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a
rectangular orthogonal mesh in O (M log M) steps, where M is the total number of grid points.
The scheme relies on an upwind finite difference approximation to the gradient and a
resulting causality relationship that lends itself to a Dijkstra-like programming approach. In
this paper, we discuss several extensions to this technique, including higher order versions
on unstructured meshes in Rn and on manifolds and connections to more general static …
rectangular orthogonal mesh in O (M log M) steps, where M is the total number of grid points.
The scheme relies on an upwind finite difference approximation to the gradient and a
resulting causality relationship that lends itself to a Dijkstra-like programming approach. In
this paper, we discuss several extensions to this technique, including higher order versions
on unstructured meshes in Rn and on manifolds and connections to more general static …
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. The scheme relies on an upwind finite difference approximation to the gradient and a resulting causality relationship that lends itself to a Dijkstra-like programming approach. In this paper, we discuss several extensions to this technique, including higher order versions on unstructured meshes in Rn and on manifolds and connections to more general static Hamilton–Jacobi equations.
National Acad Sciences
以上显示的是最相近的搜索结果。 查看全部搜索结果