Substructuring preconditioners for \(h\)-\(p\) mortar FEM (Q2820343)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Substructuring preconditioners forh−pMortar FEM |
scientific article; zbMATH DE number 6627657
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Substructuring preconditioners for \(h\)-\(p\) mortar FEM |
scientific article; zbMATH DE number 6627657 |
Statements
15 September 2016
0 references
domain decomposition methods
0 references
iterative substructuring
0 references
mortar method
0 references
\(h\)-\(p\) finite element method
0 references
elliptic problem
0 references
preconditioner
0 references
discontinuous Galerkin interior penalty method
0 references
condition number
0 references
numerical experiments
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Substructuring preconditioners for \(h\)-\(p\) mortar FEM (English)
0 references
The authors build and analyze a substructuring preconditioner for the mortar method, applied to elliptic problems, in the \(h\)-\(p\) finite element framework. In particular, attention is paid to the construction of the coarse component of the preconditioner, in which continuity at the cross points is not required. Two variants are proposed: the first one is an improved version of a coarse preconditioner already presented in a previous work for the first two authors. The second one is new and is built using a discontinuous Galerkin interior penalty method as coarse problem. A bound of the condition number is proven for both variants and their efficiency and scalability is illustrated by some numerical experiments.
0 references
