An iterative substructuring algorithm for two-dimensional problems in H(curl) (Q2903024)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6070607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative substructuring algorithm for two-dimensional problems in H(curl) |
scientific article; zbMATH DE number 6070607 |
Statements
23 August 2012
0 references
domain decomposition
0 references
iterative substructuring
0 references
H(curl) space problem
0 references
An iterative substructuring algorithm for two-dimensional problems in H(curl) (English)
0 references
In this paper, the authors present an algorithm for two-dimensional problems in space \(H_0\)(curl;\(\Omega\)). This algorithm is based on domain decomposition, which is performed in terms of a coarse space and local subspaces associated with individual edges of the subdomains. The algorithm does not require overlapping subdomains and a good condition number can be established. Simple energy minimization is applied to the coarse space. Many numerical examples are presented aswell, and they confirm the theory and show the usefulness of the algorithm.
0 references
0.8183650374412537
0 references
0.8093676567077637
0 references
0.7951341867446899
0 references
0.7792158126831055
0 references
0.7792158126831055
0 references
