The behavior of domain decomposition methods when the overlapping length is large (Q403181)
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: The behavior of domain decomposition methods when the overlapping length is large |
scientific article; zbMATH DE number 6335858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The behavior of domain decomposition methods when the overlapping length is large |
scientific article; zbMATH DE number 6335858 |
Statements
The behavior of domain decomposition methods when the overlapping length is large (English)
0 references
29 August 2014
0 references
A new approach for the convergence problem of optimized Schwarz methods by studying a generalization of these methods for a semilinear elliptic equation is introduced. The behavior of the algorithm for large overlapping lengths is studied.
0 references
domain decomposition
0 references
Schwarz methods
0 references
semilinear elliptic equations
0 references
convergence
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.813891589641571
0 references
0.8056490421295166
0 references
0.8030874729156494
0 references
0.7952761650085449
0 references
