Monotonic iterative algorithms for an implicit two-sided obstacle problem. (Q1609033)
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: Monotonic iterative algorithms for an implicit two-sided obstacle problem. |
scientific article; zbMATH DE number 1781454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monotonic iterative algorithms for an implicit two-sided obstacle problem. |
scientific article; zbMATH DE number 1781454 |
Statements
Monotonic iterative algorithms for an implicit two-sided obstacle problem. (English)
0 references
15 August 2002
0 references
Monotone iteration techniques based on lower and upper solutions are adapted to two-sided obstacle problems in finite dimensions. Convergence proofs are given. In particular, as byproduct of monotone iterations also existence of a solution is proved. Different algorithms are proposed and their properties are studied. Finally, a numerical example of a discretized obstacle problem in Sobolev spaces is considered and some test results are reported.
0 references
obstacle problem
0 references
iterative algorithm
0 references
monotone convergence
0 references
variational inequality
0 references
algorithms
0 references
numerical example
0 references
0 references
0 references
0 references
0 references
0.91806114
0 references
0.9115228
0 references
0.9065839
0 references
0.87619317
0 references
0.8749623
0 references
