Convergence rate analysis of domain decomposition methods for obstacle problems

From MaRDI portal





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.











This page was built for publication: Convergence rate analysis of domain decomposition methods for obstacle problems

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