Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem (Q1360175)
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: Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem |
scientific article; zbMATH DE number 1034182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem |
scientific article; zbMATH DE number 1034182 |
Statements
Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem (English)
0 references
7 January 1998
0 references
The paper deals with iterative algorithms for domain decomposition applied to the solution of a quasilinear elliptic problem. The author discusses the convergence results of the geometric aspects, such as dependence of the convergence rate on the amount of overlapping, the number of subdomains and their sizes. Some issues of parallel implementation of the algorithms examined are discussed.
0 references
parallel computing
0 references
iterative algorithms
0 references
domain decomposition
0 references
quasilinear elliptic problem
0 references
convergence
0 references
0 references
0.8097702860832214
0 references
0.8085355162620544
0 references
0.7983793616294861
0 references
