On the convergence rate of a parallel nonoverlapping domain decomposition method (Q2519309)
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 5497434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence rate of a parallel nonoverlapping domain decomposition method |
scientific article; zbMATH DE number 5497434 |
Statements
On the convergence rate of a parallel nonoverlapping domain decomposition method (English)
0 references
26 January 2009
0 references
The authors deal with a nonoverlapping domain decomposition iterative procedure, which is based on using Robin-type boundary conditions as information transmission conditions on the subdomain interfaces. It is known that the convergence rate of this method is \(1 - O(h)\), where \(h\) is mesh size. In this paper, the convergence rate is improved to be \(1 - O(h ^{1/2}H^{-1/2})\), by choosing suitable parameter, where \(H\) is the subdomain size. Counter examples are constructed to show that our convergence estimates are sharp.
0 references
finite elements
0 references
nonoverlapping domain decomposition
0 references
convergence rate
0 references
geometric
0 references
optimal
0 references
0 references
0 references
0 references
0 references
0.8792583346366882
0 references
0.8590155839920044
0 references
0.8472922444343567
0 references
0.8372148275375366
0 references