View : 64 Download: 0

A parallel fast sweeping method for the Eikonal equation

Title
A parallel fast sweeping method for the Eikonal equation
Authors
Detrixhe M.Gibou F.Min C.
Ewha Authors
민조홍
SCOPUS Author ID
민조홍scopus
Issue Date
2013
Journal Title
Journal of Computational Physics
ISSN
0021-9991JCR Link
Citation
vol. 237, pp. 46 - 55
Indexed
SCI; SCIE; SCOPUS WOS scopus
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.
DOI
10.1016/j.jcp.2012.11.042
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE