Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 민조홍 | * |
dc.date.accessioned | 2016-08-28T10:08:25Z | - |
dc.date.available | 2016-08-28T10:08:25Z | - |
dc.date.issued | 2013 | * |
dc.identifier.issn | 0021-9991 | * |
dc.identifier.other | OAK-9744 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/223416 | - |
dc.description.abstract | 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. © 2012 Elsevier Inc. | * |
dc.language | English | * |
dc.title | A parallel fast sweeping method for the Eikonal equation | * |
dc.type | Article | * |
dc.relation.volume | 237 | * |
dc.relation.index | SCI | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 46 | * |
dc.relation.lastpage | 55 | * |
dc.relation.journaltitle | Journal of Computational Physics | * |
dc.identifier.doi | 10.1016/j.jcp.2012.11.042 | * |
dc.identifier.wosid | WOS:000314802100003 | * |
dc.identifier.scopusid | 2-s2.0-84872474253 | * |
dc.author.google | Detrixhe M. | * |
dc.author.google | Gibou F. | * |
dc.author.google | Min C. | * |
dc.contributor.scopusid | 민조홍(57217858452) | * |
dc.date.modifydate | 20231123104234 | * |