Generalized Schwarz algorithm for obstacle problems

From MaRDI portal





Algorithms for the numerical solution of partial differential equations on a complicated domain are considered. Two algorithms for solving discrete variational inequalities are proposed. As a model problem an obstacle problem with a selfadjoint elliptic operator is discussed. Convergence theorems for the algorithms are derived. The results are illustrated by three numerical examples.











This page was built for publication: Generalized Schwarz algorithm for obstacle problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972513)