Convergence rate analysis of domain decomposition methods for obstacle problems (Q2763868)
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: Convergence rate analysis of domain decomposition methods for obstacle problems |
scientific article; zbMATH DE number 1693347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence rate analysis of domain decomposition methods for obstacle problems |
scientific article; zbMATH DE number 1693347 |
Statements
13 September 2002
0 references
Schwarz method
0 references
variational inequalities
0 references
finite elements
0 references
convergence
0 references
obstacle problem
0 references
numerical experiments
0 references
Convergence rate analysis of domain decomposition methods for obstacle problems (English)
0 references
A convergence rate estimate is given for an overlapping domain decomposition method for obstacle problems. It is shown that the computed solution will converge monotonically to the true solution if the initial value is above the obstacle and below the true solution. Moreover, the convergence rate is of the same order as for the linear elliptic problems. Numerical experiments are shown both for the additive and the multiplicative Schwarz methods.
0 references
