.png){kind=icon}
返回
A second-order distributed memory parallel fast sweeping method for the Eikonal equation
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2022.111785.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Eikonal equation is used to calculate wave propagation and distance fields, and due to its complexity requires numerical treatment for its solution. We present a second-order distributed memory parallel fast sweeping method. The second-order solution switches on a two-point stencil when two upwind points are available, and reverts to first-order otherwise. In all examples, the second-order method improves the solution over the first -order, allowing for significant savings in memory while achieving the same accuracy. Parallelization over distributed memory saw good weak scaling with optimal convergence. The computational time for second-order was approximately 2.5 times slower than first -order, where the largest amount of mesh points ran on 144 cores (512 GB) was approximate to 20 billion. The savings in memory from the second-order method combined with the distributed memory algorithm result in the ability to solve problems much larger than are possible with the serial first-order method.(c) 2022 Elsevier Inc. All rights reserved.
Keyword:
Fast sweeping method
Eikonal equation
Second-order
Parallelization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
引用论文
.png){kind=icon}
查看更多内容