Ordered Line Integral Methods for Solving the Eikonal Equation

@article{Potter2019OrderedLI,
  title={Ordered Line Integral Methods for Solving the Eikonal Equation},
  author={S. Potter and M. Cameron},
  journal={J. Sci. Comput.},
  year={2019},
  volume={81},
  pages={2010-2050}
}
The eikonal equation is used to model high-frequency wave propagation and solve a variety of applied problems in computational science. We present a family of fast and accurate Dijkstra-like solvers for the eikonal equation and factored eikonal equation, which compute solutions on a regular grid by solving local variational minimization problems. Our methods converge linearly but compute significantly more accurate solutions than competing linear methods, due to improved directional coverage… Expand
Computing the quasipotential for nongradient SDEs in 3D
TLDR
A Dijkstra-like solver for computing the quasipotential on regular rectangular meshes in 3D is proposed and applied to Tao's examples where the transition states are hyperbolic periodic orbits, and to a genetic switch model by Lv et al. (2014). Expand
Jet Marching Methods for Solving the Eikonal Equation
TLDR
These solvers are designed specifically for computing a high-frequency approximation of the Helmholtz equation in a complicated environment with a slowly varying speed of sound, and, to the best of the knowledge, are the first solvers with these properties. Expand

References

SHOWING 1-10 OF 70 REFERENCES
A fast marching algorithm for the factored eikonal equation
TLDR
A Fast Marching algorithm for the factored eikonal equation, using both first and second order finite-difference schemes, which follows the same lines as the original FM algorithm and requires the same computational effort. Expand
Fast sweeping method for the factored eikonal equation
TLDR
A fast sweeping method is developed to enforce the causality of the original eikonal equation during the Gauss-Seidel iterations and the numerical solution from the factored ekonal equation is more accurate than the numerical solutions directly computed from the original Eikonal equations. Expand
3-D traveltime computation using the fast marching method
We present a fast algorithm for solving the eikonal equation in three dimensions, based on the fast marching method. The algorithm is of the order O(N log N), where N is the total number of gridExpand
A fast sweeping method for Eikonal equations
  • H. Zhao
  • Mathematics, Computer Science
  • Math. Comput.
  • 2005
TLDR
Monotonicity and stability properties of the fast sweeping algorithm are proven and it is shown that 2 n Gauss-Seidel iterations is enough for the distance function in n dimensions. Expand
Fast Sweeping Methods for Factored Anisotropic Eikonal Equations: Multiplicative and Additive Factors
TLDR
The factorization idea is applied to numerically compute viscosity solutions of anisotropic eikonal equations with a point-source condition and the resulting monotone schemes yield clean first-order convergence rather than polluted first- order convergence. Expand
Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes.
  • J. Sethian, A. Vladimirsky
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2000
TLDR
Several extensions to the Fast Marching Method are discussed, including higher order versions on unstructured meshes in Rn and on manifolds and connections to more general static Hamilton-Jacobi equations. Expand
Fast-phase space computation of multiple arrivals
  • S. Fomel, J. Sethian
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
A fast, general computational technique for computing the phase-space solution of static Hamilton–Jacobi equations, building on ideas from semi-Lagrangian methods, Dijkstra-like methods for the Eikonal equation, and Ordered Upwind Methods. Expand
3-D eikonal solvers: First-arrival traveltimes
The article is concerned with the development and comparison of three different algorithms for the computation of first‐arrival traveltimes: the fast marching method (FMM), the group marching methodExpand
A fast marching level set method for monotonically advancing fronts.
  • J. Sethian
  • Medicine, Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1996
A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniquesExpand
Fast Two-scale Methods for Eikonal Equations
TLDR
This paper explores the possibility of combining the best features of both approaches by using Marching on a coarser scale and sweeping on a finer scale, and presents three new hybrid methods based on this idea. Expand
...
1
2
3
4
5
...