.png){kind=icon}
返回
Implicit-explicit parallel asynchronous solver of parabolic PDES
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827595281290.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a method for the solution of parabolic PDEs on parallel computers, which is a combination of implicit and explicit finite difference schemes based on a domain decomposition (DD) strategy. Moreover, this method is asynchronous (i.e., no explicit synchronization is required among processors). We determine the values at subdomains' boundaries by our new high-order asynchronous explicit schemes. Then, any known high-order implicit finite difference scheme can be applied within each subdomain. We present a technique for derivation of appropriate asynchronous-explicit schemes based on Green's functions. Synchronous versions of these schemes are obtained as special cases. The applicability of this method is also demonstrated for a family of nonlinear problems. Our new explicit schemes are of high order and yet stable for a large time step, as established in our analysis of their numerical properties. Moreover, these schemes provide attractive properties for parallel implementation. Being asynchronous, they allow local time stepping, thus eliminating the need for a global synchronized time step. Moreover, our asynchronous computation is time stabilizing, in the sense that the calculation implicitly prevents a growing time gap between neighboring subdomains. The locality property, due to the exponential decay of Green's functions, implies that communication is needed only between neighboring processors. Hence, this method which is designed to minimize the overhead associated with the synchronization of the multiple processors is specifically suitable for parallel computers having a high synchronization cost or highly varying load, even in cases in which some processors have persistent speed differences. Furthermore, the implementation of different resolution in each subdomain (e.g., irregular or unstructured grid) makes it valuable as an adaptive algorithm. The above schemes were implemented and tested on the shared-memory multi-user Cray J90 and Sequent Balance machines. These implementations prove high accuracy and high degree of parallelism. This work is complementary to our previous work on asynchronous schemes [Comput. Math. Appl., 24 (1992), pp. 33-53; Appl. Numer. Math., 12 (1993), pp. 27-45; Numer. Algorithms,6 (1994), pp. 275-296; Numer. Algorithms, 12 (1996), pp. 159-192].
Keyword:
parallel asynchronous and synchronous finite difference methods
parabolic finite difference approximations with constant coefficients synchronization overhead
Green's function-based approximations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
Affinity labeling of bovine carboxypeptidase A γLeu by N-bromoacetyl-N-methyl-L-phenylalanine. I. Kinetics of inactivation.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏Broadband interfacing of superconducting digital systems to room temperature electronics超导数字系统与室温电子设备的宽带接口
PREAI
分享收藏分享收藏Limits on deviations from Onsager-Casimir symmetry in the resistance ofYBa2Cu3O7−δ对YBa₂Cu₃O₇₋δ电阻偏离翁萨格-开尔文对称性的限制
PREAI
分享收藏
分享收藏Optimization of co-evaporation conditions of as-grown MgB2 thin films by molecular beam epitaxy通过分子束外延生长的MgB2薄膜共蒸发条件的优化
PREAI
分享收藏
查看更多内容