An approximate BDDC preconditioner

An approximate BDDC preconditioner
复制标题

近似 BDDC 预处理器

DOI:
--
复制
发表时间:
2007
影响因子:
4.3
通讯作者:
C. Dohrmann
C. Dohrmann
中科院分区:
数学3区
文献类型:
--
作者:
C. Dohrmann

文献摘要

被引文献

相似文献

按约束平衡域分解 (BDDC) 预处理器需要直接求解每个子结构的两个线性系统和一个全局粗略问题的线性系统。如果任何一个系统太大,这些解决方案所需的计算和内存可能会令人望而却步。我们研究了一种基于使用预处理器近似直接解决方案来解决此问题的方法。为了保留 BDDC 精确版本的有吸引力的数值属性,一些预处理器必须拥有与子结构零空间相关的属性。我们描述了一种为预处理器配备此属性的简单方法。数值结果证明了该方法的实用性并证实了该理论。 John Wiley & Sons, Ltd 于 2006 年出版
The balancing domain decomposition by constraints (BDDC) preconditioner requires direct solutions of two linear systems for each substructure and one linear system for a global coarse problem. The computations and memory needed for these solutions can be prohibitive if any one system is too large. We investigate an approach for addressing this issue based on approximating the direct solutions using preconditioners. In order to retain the attractive numerical properties of the exact version of BDDC, some of the preconditioners must possess a property related to the substructure null spaces. We describe a simple method to equip preconditioners with this property. Numerical results demonstrate the usefulness of the approach and confirm the theory. Published in 2006 by John Wiley & Sons, Ltd.