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

被引:16
作者
Bavestrello, H. [1 ]
Avery, P. [1 ]
Farhat, C. [1 ]
机构
[1] Stanford Univ, Dept Mech Engn, Inst Computat & Math Engn, Stanford, CA 94305 USA
基金
美国国家科学基金会;
关键词
assembly; conjugate gradients; domain decomposition; floating substructures; FETI-DP; mortar; multipoint constraints;
D O I
10.1016/j.cma.2006.03.024
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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. (c) 2006 Published by Elsevier B.V.
引用
收藏
页码:1347 / 1368
页数:22
相关论文
共 47 条