COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE (Q3350657)
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: COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE |
scientific article; zbMATH DE number 4199462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE |
scientific article; zbMATH DE number 4199462 |
Statements
COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE (English)
0 references
1989
0 references
parallel computation
0 references
sharp convergence rate estimates
0 references
Schwarz alternating procedure
0 references
Poisson problem
0 references
complexity
0 references
multigrid
0 references
domain decomposition
0 references
0.8400583863258362
0 references
0.8293911814689636
0 references
0.8288714289665222
0 references
0.8268688321113586
0 references
