Header

UZH-Logo

Maintenance Infos

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.

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.

Statistics

Citations

3 citations in Web of Science®
2 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

62 downloads since deposited on 20 Jan 2010
16 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Date:2006
Deposited On:20 Jan 2010 08:11
Last Modified:21 Nov 2017 14:21
Publisher:Springer
ISSN:0008-0624
Additional Information:The original publication is available at www.springerlink.com
Publisher DOI:https://doi.org/10.1007/s10092-006-0118-4

Download

Download PDF  'Efficient numerical solution of Neumann problems on complicated domains'.
Preview
Content: Accepted Version
Filetype: PDF
Size: 1MB
View at publisher