Abstract

t is well known that Galerkin discretizations based on hp-finite element spaces are converging exponentially with respect to the degrees of freedom for elliptic problems with piecewise analytic data. However, the question whether these methods can be realized for general situations such that the exponential convergence is preserved also with respect to the computing time is very essential.
We show how the numerical quadrature can be realized in order that the resulting fully discrete hp-boundary element method (BEM) converges exponentially with algebraically growing work. The key point is to approximate the integrals constituting the stiffness matrix by exponentially converging cubature methods.