Domain decomposition with non matching grids and adaptive finite element techniques (Q2708281)
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 1588140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Domain decomposition with non matching grids and adaptive finite element techniques |
scientific article; zbMATH DE number 1588140 |
Statements
14 January 2002
0 references
preconditioning
0 references
convergence
0 references
domain decomposition
0 references
algorithm
0 references
semilinear elliptic problems
0 references
numerical results
0 references
finite element
0 references
non-matching grids
0 references
conjugate gradient algorithm
0 references
Domain decomposition with non matching grids and adaptive finite element techniques (English)
0 references
The authors propose and study a domain decomposition preconditioned algorithm well adapted to semilinear elliptic problems. They prove that this algorithm converges independently of the discretization step \(h\) and give some numerical results to illustrate the efficiency of the solvers when we combine adaptive finite element techniques and domain decomposition methods with non-matching grids for handling the less regular part of the solution. Moreover, the proposed algorithm is compared to the Newton preconditioned conjugate gradient algorithm.
0 references
0.8194524049758911
0 references
