A fast marching algorithm for the factored eikonal equation
Authors:
- Eran TreisterETEran Treister
- Eldad HaberEHEldad Haber
- 1 November 2016
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 324, 210-225
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Seventh Framework Programme (623212)
This publication has 29 references indexed in Scilit:
- Factored singularities and high-order Lax–Friedrichs sweeping schemes for point-source traveltimes and amplitudesJournal of Computational Physics, 2011
- A fast method for the solution of the Helmholtz equationJournal of Computational Physics, 2011
- Fast sweeping method for the factored eikonal equationJournal of Computational Physics, 2009
- A fast sweeping method for Eikonal equationsMathematics of Computation, 2004
- Lax–Friedrichs sweeping scheme for static Hamilton–Jacobi equationsJournal of Computational Physics, 2004
- An adaptive finite-difference method for traveltimes and amplitudesGeophysics, 2002
- Fast Marching MethodsSIAM Review, 1999
- Efficient algorithms for globally optimal trajectoriesIEEE Transactions on Automatic Control, 1995
- Nonlinear total variation based noise removal algorithmsPhysica D: Nonlinear Phenomena, 1992
- Viscosity solutions of Hamilton-Jacobi equationsTransactions of the American Mathematical Society, 1983