An improved subspace selection algorithm for meshless collocation methods

Leevan LING*, Robert Schaback

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

50 Citations (Scopus)


Choosing data points is a common problem for researchers who employ various meshless methods for solving partial differential equations. On the one hand, high accuracy is always desired; on the other, ill-conditioning problems of the resultant matrices, which may lead to unstable algorithms, prevent some researchers from using meshless methods. For example, the optimal placements of source points in the method of fundamental solutions or of the centers in the radial basis functions method are always unclear. Intuitively, such optimal locations will depend on many factors: the partial differential equations, the domain, the trial basis used (i.e. the employed method itself), the computational precisions, some userdefined parameters, and so on. Such complexity makes the hope of having an optimal centers placement unpromising. In this paper, we provide a data-dependent algorithm that adaptively selects centers based on all the other variables.

Original languageEnglish
Pages (from-to)1623-1639
Number of pages17
JournalInternational Journal for Numerical Methods in Engineering
Issue number13
Publication statusPublished - 24 Dec 2009

Scopus Subject Areas

  • Numerical Analysis
  • Engineering(all)
  • Applied Mathematics

User-Defined Keywords

  • Adaptive greedy algorithm
  • Collocation
  • Kansa's method
  • Radial basis function


Dive into the research topics of 'An improved subspace selection algorithm for meshless collocation methods'. Together they form a unique fingerprint.

Cite this