Abstract
One particular strength of the boundary element method is that it allows for a high-order pointwise approximation of the solution of the related partial differential equation via the representation formula. However, the high-order convergence and hence accuracy usually suffers from singularities of the Cauchy data. We propose two adaptive mesh-refining algorithms and prove their quasi-optimal convergence behavior with respect to an a posteriori computable bound for the point error in the representation formula. Numerical examples for the weakly-singular integral equations for the 2D and 3D Laplacian underline our theoretical findings.
| Original language | English |
|---|---|
| Pages (from-to) | 541-567 |
| Number of pages | 27 |
| Journal | Numerische Mathematik |
| Volume | 132 |
| Issue number | 3 |
| Early online date | 24 May 2015 |
| DOIs | |
| Publication status | Published - Mar 2016 |
| Externally published | Yes |
Keywords
- n/a OA procedure
Fingerprint
Dive into the research topics of 'Adaptive boundary element methods for optimal convergence of point errors'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver