A highly scalable massively parallel fast marching method for the eikonal equation
DOI10.1016/j.jcp.2016.12.012zbMath1380.65329arXiv1502.07303OpenAlexW1581532933MaRDI QIDQ680108
Frederick Stern, Jian-Ming Yang
Publication date: 22 January 2018
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.07303
domain decompositionlevel setparallel algorithmeikonal equationdistance functionfast marching methodreinitializationmassively parallel implementationnarrow band approachstatic Hamilton-Jacobi equation
Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06)
Related Items (14)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Parallel solutions of static Hamilton-Jacobi equations for simulations of geological folds
- An adaptive domain-decomposition technique for parallelization of the fast marching method
- Fast Two-scale Methods for Eikonal Equations
- A Fast Iterative Method for Eikonal Equations
- A Parallel Two-Scale Method for Eikonal Equations
- A Viscosity Solutions Approach to Shape-From-Shading
- A fast sweeping method for Eikonal equations
- Efficient algorithms for globally optimal trajectories
- A fast marching level set method for monotonically advancing fronts.
This page was built for publication: A highly scalable massively parallel fast marching method for the eikonal equation