go-v.orgdoi

Numerical Solution Of Obstacle Problems By Overlapping Block Relaxation Methods

Pasi Tarvainen · WIT transactions on engineering sciences · 1970

  • DOI 10.2495/con950331
  • Publisher WIT Press
  • Type article
  • Issued 1970

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

WIT transactions on engineering sciences · WIT Press · article · 1970

Abstract

Overlapping block relaxation methods are applied to the iterative solution of algebraic obstacle problems with M-matrices. Such problems arise, eg., from finite element approximation of obstacle problems with diffusion or convection-diffusion operators. We propose and analyze various algorithms with the emphasis on their monotonicity properties: the methods are monotonically convergent in the subset of supersolutions, and their asymptotic convergence rates can be evaluated in this particular subset. We also discuss the multilevel approach within the block relaxation methods; this approach makes possible to choose individual subproblem solvers for the methods.

Numerical experiments are included to illustrate the theoretical results.

Open the resolved locator · 10.2495/con950331

Metadata licence: OpenAlex metadata (CC0)