首页> 外文期刊>Computing and visualization in science >Direct Schur complement method by domain decomposition based on H-matrix approximation
【24h】

Direct Schur complement method by domain decomposition based on H-matrix approximation

机译:基于H矩阵近似的区域分解直接Schur补码方法

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

摘要

The goal of this paper is the construction of a data-sparse approximation to the Schur complement on the interface corresponding to FEM and BEM approximations of an elliptic equation by domain decomposition. Using the hierarchical (H-matrix) formats we elaborate the approximate Schur complement inverse in an explicit form. The required cost O (N Γlog q N Γ) is almost linear in N Γ – the number of degrees of freedom on the interface. As input, we require the Schur complement matrices corresponding to subdomains and represented in the H-matrix format. In the case of piecewise constant coefficients these matrices can be computed via the BEM representation with the cost O(N Γlog q N Γ), while in the general case the FEM discretisation leads to the complexity O(N Ωlog q N Ω), where N Ω is the number of degrees of freedom in the domain.
机译:本文的目的是通过域分解构造对应于椭圆方程的FEM和BEM近似的界面上Schur补的数据稀疏近似。使用分层(H矩阵)格式,我们以显式形式阐述了近似Schur补码逆。所需的成本O(N loglog NΓ)在NΓ上几乎是线性的-界面上的自由度数。作为输入,我们需要对应于子域并以H矩阵格式表示的Schur补矩阵。在分段常数系数的情况下,可以通过BEM表示以成本O(N loglog NΓ)计算这些矩阵,而在一般情况下,FEM离散化会导致复杂度O(NΩlogq NΩ),其中NΩ是域中的自由度数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号