Numerical verifications of solutions for obstacle problems
The authors consider two-dimensional obstacle problems. They point out that any solution is subject to rounding errors and show that for these problems the solution is associated with a fixed-point theorem. They discuss an approximation to the problem which can be solved by means of minimisation of a functional in terms of an orthonormal set of functions. Using the Kuhn-Tucker theorem the conditions for an optimal solution are obtained. An iterative solution with the first approximation being a Galerkin approximation to the solution is developed and the concept of \(\delta\)-inflation is introduced. An error bound is obtained for the approximate solution of a particular problem. For the entire collection see [Zbl 0973.00063].
- An approach to the numerical verification of solutions for obstacle problems
- Solving obstacle problems with guaranteed accuracy.
- Numerical verification of solutions for obstacle problems.
- Verification for existence of solutions for some generalized obstacle problems
- scientific article; zbMATH DE number 2065721
- Solving obstacle problems with guaranteed accuracy.
- Numerical verification of solutions for obstacle problems.
- On characterizations and regularity of the solution of bilateral obstacle problems
- An approach to the numerical verification of solutions for obstacle problems
- Numerical approximation of a unilateral obstacle problem
This page was built for publication: Numerical verifications of solutions for obstacle problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765608)
