首页> 外文期刊>Computer Methods in Applied Mechanics and Engineering >Incorporation of linear multipoint constraints in domain-decomposition-based iterative solvers - Part Ⅱ: Blending FETI-DP and mortar methods and assembling floating substructures
【24h】

Incorporation of linear multipoint constraints in domain-decomposition-based iterative solvers - Part Ⅱ: Blending FETI-DP and mortar methods and assembling floating substructures

机译:线性多点约束在基于域分解的迭代求解器中的合并-第二部分:混合FETI-DP和砂浆方法并组装浮动子结构

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

摘要

Two approaches are presented for extending the FETI-DP domain-decomposition-based iterative method to the solution of problems with Linear Multipoint Constraints (LMPCs). Both cases of arbitrary LMPCs and LMPCs generated by the mortar method for enforcing a weak continuity of the solution across non-matching finite element interfaces are considered. In the first approach, the LMPCs are addressed during the preconditioning step but enforced only at convergence. In the second approach, the LMPCs are enforced at each iteration through the solution of an auxiliary coarse problem. Both extended FETI-DP solvers are benchmarked on a parallel processor for a wide range of constrained structural mechanics problems. The obtained results reveal that both solvers are numerically scalable and complement each other from the memory and CPU performance viewpoints.
机译:提出了两种方法,用于将基于FETI-DP域分解的迭代方法扩展到线性多点约束(LMPC)问题的解决方案。都考虑了任意LMPC和通过迫击炮法生成的LMPC的情况,以强制解决方案在不匹配的有限元界面上的弱连续性。在第一种方法中,LMPC在预处理步骤中得到解决,但仅在收敛时才执行。在第二种方法中,LMPC是在每次迭代中通过辅助粗略问题的解决方案实施的。两种扩展的FETI-DP求解器都在并行处理器上进行了基准测试,可解决各种受限的结构力学问题。获得的结果表明,从内存和CPU性能的角度来看,两个求解器在数值上都是可扩展的,并且可以相互补充。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号