Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem

<p>We provide a maximum norm analysis of an overlapping Schwarz method on nonmatching grids for second-order elliptic obstacle problem. We consider a domain which is the union of two overlapping subdomains where each subdomain has its own independently generated grid. The grid points on the su...

Full description

Bibliographic Details
Format: Article
Language:English
Published: SpringerOpen 2006-01-01
Series:Advances in Difference Equations
Online Access:http://www.hindawi.com/GetArticle.aspx?doi=10.1155/ADE/2006/85807
id doaj-7283b52e18e2488e84a1c490c375d27e
record_format Article
spelling doaj-7283b52e18e2488e84a1c490c375d27e2020-11-25T00:24:59ZengSpringerOpenAdvances in Difference Equations1687-18392006-01-012006Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem<p>We provide a maximum norm analysis of an overlapping Schwarz method on nonmatching grids for second-order elliptic obstacle problem. We consider a domain which is the union of two overlapping subdomains where each subdomain has its own independently generated grid. The grid points on the subdomain boundaries need not match the grid points from the other subdomain. Under a discrete maximum principle, we show that the discretization on each subdomain converges quasi-optimally in the <mml:math alttext="$L^{infty}$"> <mml:msup> <mml:mi>L</mml:mi> <mml:mi>&#x221E;</mml:mi> </mml:msup> </mml:math> norm.</p>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/ADE/2006/85807
collection DOAJ
language English
format Article
sources DOAJ
title Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem
spellingShingle Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem
Advances in Difference Equations
title_short Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem
title_full Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem
title_fullStr Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem
title_full_unstemmed Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem
title_sort maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem
publisher SpringerOpen
series Advances in Difference Equations
issn 1687-1839
publishDate 2006-01-01
description <p>We provide a maximum norm analysis of an overlapping Schwarz method on nonmatching grids for second-order elliptic obstacle problem. We consider a domain which is the union of two overlapping subdomains where each subdomain has its own independently generated grid. The grid points on the subdomain boundaries need not match the grid points from the other subdomain. Under a discrete maximum principle, we show that the discretization on each subdomain converges quasi-optimally in the <mml:math alttext="$L^{infty}$"> <mml:msup> <mml:mi>L</mml:mi> <mml:mi>&#x221E;</mml:mi> </mml:msup> </mml:math> norm.</p>
url http://www.hindawi.com/GetArticle.aspx?doi=10.1155/ADE/2006/85807
_version_ 1725350565023580160