Discretized obstacle problems with penalties on nested grids
The author proposes a nested iterative scheme for solving obstacle problems with constraints, in which the constraints are handled by penalties. At each step of the iteration, the penalty parameter is chosen according to the discretization parameter. The scheme may be considered as cascade, however, which is not like in partial differential equations but in which the penalty parameter is changed from one discretization level to the next one. Four numerical examples are presented for the elastic-plastic torsion problem and the obstacle problem for a membrane.
- On the solution of discretized obstacle problems by an adapted penalty method
- An interior penalty approach to a large-scale discretized obstacle problem with nonlinear constraints
- A penalty method for some nonlinear variational obstacle problems
- scientific article; zbMATH DE number 2152284
- Area of contraction of Newton's method applied to a penalty technique for obstacle problems
- A multigrid method for the Cahn-Hilliard equation with obstacle potential
- On the solution of discretized obstacle problems by an adapted penalty method
- An algorithm for solving the obstacle problems
- Numerical analysis for a new kind of obstacle problem
- Optimal control of an elastic-rigid obstacle problem
- Randomized neural network methods for solving obstacle problems
- Analysis of a new kind of elastic-rigid bilateral obstacle problem
- An algorithm for solving the double obstacle problems
This page was built for publication: Discretized obstacle problems with penalties on nested grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964384)