Meshless Galerkin algorithms for boundary integral equations with moving least square approximations

  • Authors:
  • Xiaolin Li

  • Affiliations:
  • College of Mathematics Science, Chongqing Normal University, Chongqing 400047, PR China

  • Venue:
  • Applied Numerical Mathematics
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we first give error estimates for the moving least square (MLS) approximation in the H^k norm in two dimensions when nodes and weight functions satisfy certain conditions. This two-dimensional error results can be applied to the surface of a three-dimensional domain. Then combining boundary integral equations (BIEs) and the MLS approximation, a meshless Galerkin algorithm, the Galerkin boundary node method (GBNM), is presented. The optimal asymptotic error estimates of the GBNM for three-dimensional BIEs are derived. Finally, taking the Dirichlet problem of Laplace equation as an example, we set up a framework for error estimates of the GBNM for boundary value problems in three dimensions.