...
首页> 外文期刊>Journal of Computational and Applied Mathematics >An alternating explicit-implicit domain decomposition method for the parallel solution of parabolic equations
【24h】

An alternating explicit-implicit domain decomposition method for the parallel solution of parabolic equations

机译:抛物方程并行解的交替显式-隐式域分解方法

获取原文
获取原文并翻译 | 示例

摘要

Explicit-implicit domain decomposition (EIDD) is a class of globally non-iterative, non-overlapping domain decomposition methods for the numerical solution of parabolic problems on parallel computers, which are highly efficient both computationally and communicationally for each time step. In this paper an alternating EIDD method is proposed which is algorithmically simple, efficient for each time step, highly parallel, and satisfies a stability condition that imposes no additional restriction to the time step restriction imposed by the consistency condition, which guarantees a convergence of order O(Delta th(-1) root N (B) / N) + O(h(2)) in an H-1-type norm, where N-B and N, respectively, denote the number of gridpoints on the interface boundaries B and the number of gridpoints on the entire discrete domain. (c) 2006 Elsevier B.V. All rights reserved.
机译:显式-隐式域分解(EIDD)是一类全局的非迭代,不重叠的域分解方法,用于并行计算机上抛物线问题的数值解,在每个时间步上都是高效的计算和通信方式。本文提出了一种交替的EIDD方法,该算法算法简单,每个时间步高效,高度并行,并且满足一个稳定性条件,该条件对一致性条件所施加的时间步限制没有任何附加限制,从而保证了阶次收敛。 H-1型范数中的O(Delta th(-1)根N(B)/ N)+ O(h(2)),其中NB和N分别表示界面边界B上的网格点数以及整个离散域上的网格点数。 (c)2006 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号