Journal
JOURNAL OF COMPUTATIONAL PHYSICS
Volume 237, Issue -, Pages 46-55Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2012.11.042
Keywords
Eikonal equation; Cuthill-McKee ordering; Parallel implementation; Fast sweeping method
Funding
- ONR [N00014-11-1-0027]
- NSF [CHE 1027817, CNS-0960316]
- DOE [DE-FG02-08ER15991]
- ICB [W911NF-09-D-0001]
- NSF IGERT Grant [DGE-0221715]
- W.M. Keck Foundation
- Priority Research Centers Program through the National Research Foundation of Korea (NRF)
- Ministry of Education, Science and Technology [2012-0006691]
- National Research Foundation of Korea (NRF) Grant
- Korea government (MEST) [2012-0003385]
- Center for Scientific Computing at the CNSI
- MRL: an NSF MRSEC [DMR-1121053]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [960316] Funding Source: National Science Foundation
Ask authors/readers for more resources
We present an algorithm for solving in parallel the Eikonal equation. The efficiency of our approach is rooted in the ordering and distribution of the grid points on the available processors; we utilize a Cuthill-McKee ordering. The advantages of our approach is that (1) the efficiency does not plateau for a large number of threads; we compare our approach to the current state-of-the-art parallel implementation of Zhao (2007) [14] and (2) the total number of iterations needed for convergence is the same as that of a sequential implementation, i.e. our parallel implementation does not increase the complexity of the underlying sequential algorithm. Numerical examples are used to illustrate the efficiency of our approach. (c) 2012 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
