Ordered line integral methods for solving the eikonal equation

From MaRDI portal
Publication:2291900

DOI10.1007/S10915-019-01077-ZzbMATH Open1434.65307arXiv1902.06825OpenAlexW2988353054WikidataQ126842995 ScholiaQ126842995MaRDI QIDQ2291900FDOQ2291900


Authors: S. Potter, Maria Kourkina Cameron Edit this on Wikidata


Publication date: 31 January 2020

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Abstract: 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 first order methods. In 3D, we present two different families of algorithms which significantly reduce the number of FLOPs needed to obtain an accurate solution to the eikonal equation. One method employs a fast search using local characteristic directions to prune unnecessary updates, and the other uses the theory of constrained optimization to achieve the same end. The proposed solvers are more efficient than the standard fast marching method in terms of the relationship between error and CPU time. We also modify our method for use with the additively factored eikonal equation, which can be solved locally around point sources to maintain linear convergence. We conduct extensive numerical simulations and provide theoretical justification for our approach. A library that implements the proposed solvers is available on GitHub.


Full work available at URL: https://arxiv.org/abs/1902.06825




Recommendations




Cites Work


Cited In (7)

Uses Software





This page was built for publication: Ordered line integral methods for solving the eikonal equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291900)