.png){kind=icon}
.png){kind=icon}
Return
A parallel fast sweeping method for the Eikonal equation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2012.11.042.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Eikonal equation
Cuthill-McKee ordering
Parallel implementation
Fast sweeping method
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W
