DeepAI AI Chat
Log In Sign Up

Convergence analysis of oversampled collocation boundary element methods in 2D

by   Georg Maierhofer, et al.

Collocation boundary element methods for integral equations are easier to implement than Galerkin methods because the elements of the discretization matrix are given by lower-dimensional integrals. For that same reason, the matrix assembly also requires fewer computations. However, collocation methods typically yield slower convergence rates and less robustness, compared to Galerkin methods. We explore the extent to which oversampled collocation can improve both robustness and convergence rates. We show that in some cases convergence rates can actually be higher than the corresponding Galerkin method, although this requires oversampling at a faster than linear rate. In most cases of practical interest, oversampling at least lowers the error by a constant factor. This can still be a substantial improvement: we analyze an example where linear oversampling by a constant factor J (leading to a rectangular system of size JN × N) improves the error at a cubic rate in the constant J. Furthermore, the oversampled collocation method is much less affected by a poor choice of collocation points, as we show how oversampling can lead to guaranteed convergence. Numerical experiments are included for the two-dimensional Helmholtz equation.


page 4

page 26


Fast large-scale boundary element algorithms

Boundary element methods (BEM) reduce a partial differential equation in...

Superconvergence of discontinuous Petrov-Galerkin approximations in linear elasticity

Existing a priori convergence results of the discontinuous Petrov-Galerk...

Weak convergence rates for a full implicit scheme of stochastic Cahn-Hilliard equation with additive noise

The aim of this study is the weak convergence rate of a temporal and spa...

A locally mass conserving quadratic velocity, linear pressure element

By supplementing the pressure space for the Taylor-Hood element a triang...