# Efficient numerical solution of Neumann problems on complicated domains

Nicaise, S; Sauter, S (2006). Efficient numerical solution of Neumann problems on complicated domains. Calcolo, 43(2):95-120.

## Abstract

We consider elliptic partial differential equations with Neumann boundary conditions on complicated domains. The discretization is performed by composite finite elements.
The a priori error analysis typically is based on precise knowledge of the regularity of the solution. However, the constants in the regularity estimates possibly depend critically on the geometric details of the domain and the analysis of their quantitative influence is rather involved.
Here, we consider a polyhedral Lipschitz domain Ω with a possibly huge number of geometric details ranging from size O(ε) to O(1). We assume that Ω is a perturbation of a simpler Lipschitz domain Ω. We prove error estimates where only the regularity of the partial differential equation on Ω is needed along with bounds on the norm of extension operators which are explicit in appropriate geometric parameters.
Since composite finite elements allow a multiscale discretization of problems on complicated domains, the linear system which arises can be solved by a simple multi-grid method. We show that this method converges at an optimal rate independent of the geometric structure of the problem.

We consider elliptic partial differential equations with Neumann boundary conditions on complicated domains. The discretization is performed by composite finite elements.
The a priori error analysis typically is based on precise knowledge of the regularity of the solution. However, the constants in the regularity estimates possibly depend critically on the geometric details of the domain and the analysis of their quantitative influence is rather involved.
Here, we consider a polyhedral Lipschitz domain Ω with a possibly huge number of geometric details ranging from size O(ε) to O(1). We assume that Ω is a perturbation of a simpler Lipschitz domain Ω. We prove error estimates where only the regularity of the partial differential equation on Ω is needed along with bounds on the norm of extension operators which are explicit in appropriate geometric parameters.
Since composite finite elements allow a multiscale discretization of problems on complicated domains, the linear system which arises can be solved by a simple multi-grid method. We show that this method converges at an optimal rate independent of the geometric structure of the problem.

## Citations

2 citations in Web of Science®
1 citation in Scopus®

## Altmetrics

Detailed statistics

Item Type: Journal Article, refereed, original work 07 Faculty of Science > Institute of Mathematics 510 Mathematics English 2006 20 Jan 2010 08:11 05 Apr 2016 13:24 Springer 0008-0624 The original publication is available at www.springerlink.com https://doi.org/10.1007/s10092-006-0118-4
Permanent URL: https://doi.org/10.5167/uzh-21629

 Preview
Content: Accepted Version
Filetype: PDF
Size: 1MB
View at publisher

## TrendTerms

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.
You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.