Automatic domain decomposition for radial basis meshless methods in solving problems with concavity and singularity

T. S. Li, S. M. Wong

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Radial basis functions(RBFs) has been used for interpolating scattered points before they are used in solving PDEs. RBFs have the advantage that they do not require a mesh which can be difficult and time consuming to construct especially in three dimensional cases. However, being global smooth functions, RBFs have problems in modelling entities with discontinuity and concavity. Domain decomposition is a solution to both problems. In this paper, we introduce a method to automatically decompose any object into a number of domains so that each domain would have no concavity. The method is to form a constrained Delaunay triangulation of nodal points on the boundary of the object. The concavity can then be discovered by identifying groups of external triangles that are enclosed by the object. Then each domain is modelled by a separate RBF. Smoothness between different domains is maintained by using the overlapping domains method.

Original languageEnglish
Pages (from-to)385-404
Number of pages20
JournalDynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms
Volume23
Issue number6
Publication statusPublished - 2016

Keywords

  • Concavity
  • Domain decomposition
  • Radial basis function
  • Singularity

Fingerprint

Dive into the research topics of 'Automatic domain decomposition for radial basis meshless methods in solving problems with concavity and singularity'. Together they form a unique fingerprint.

Cite this