1991
DOI: 10.1002/nme.1620320604
|View full text |Cite
|
Sign up to set email alerts
|

A method of finite element tearing and interconnecting and its parallel solution algorithm

Abstract: SUMMARYA novel domain decomposition approach for the parallel finite element solution of equilibrium equations is presented. The spatial domain is partitioned into a set of totally disconnected subdomains, each assigned to an individual processor. Lagrange multipliers are introduced to enforce compatibility at the interface nodes. In the static case, each floating subdomain induces a local singularity that is resolved in two phases. First, the rigid body modes are eliminated in parallel from each local problem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
814
0
4

Year Published

1997
1997
2016
2016

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 1,095 publications
(838 citation statements)
references
References 10 publications
2
814
0
4
Order By: Relevance
“…The Boundary Element Tearing and Interconnecting Method (BETI) is a domain decomposition method based on the Symmetric Galerkin BEM [4] similar to the Finite Element Tearing and Interconnecting Method (FETI) for the FEM introduced by [5]. In this work the collocation BEM is used to set up the equation system similar to the original BETI method.…”
Section: Boundary Element Tearing and Interconnecting Methods (Beti)mentioning
confidence: 99%
“…The Boundary Element Tearing and Interconnecting Method (BETI) is a domain decomposition method based on the Symmetric Galerkin BEM [4] similar to the Finite Element Tearing and Interconnecting Method (FETI) for the FEM introduced by [5]. In this work the collocation BEM is used to set up the equation system similar to the original BETI method.…”
Section: Boundary Element Tearing and Interconnecting Methods (Beti)mentioning
confidence: 99%
“…FETI-1 [13,14,12,23] is a non-overlapping DDM [16]. Thus, it is based on decomposing the original spatial domain into non-overlapping subdomains.…”
Section: Permonfllopmentioning
confidence: 99%
“…PERMON extends PETSc [3] with support for quadratic programming (QP) and non-overlapping domain decomposition methods (DDM), namely of the FETI (Finite Element Tearing and Interconnecting) [13,12,5,24] type. This paper presents the process of solving contact problems using PERMON (Section 3).…”
Section: Introductionmentioning
confidence: 99%
“…This transforms (4) into a saddle point problem; see [5,7,8]. Such a choice is perfectly admissible for matching interfaces but is prone to difficulties when Γ c 1 = Γ c 2 because the approximation of H −1/2 (Γ c ) cannot be "split" between the two distinct interfaces.…”
Section: A Matching Interface Problem For the Poisson Equationmentioning
confidence: 99%
“…The strong problem (2)- (3) does not admit a natural extension to this case and so, to obtain a formal statement of the interface problem we proceed with the weak saddle-point equation (5).…”
Section: A Non-matching Interface Problem Of the Poisson Equationmentioning
confidence: 99%