Dimension-splitting data points redistribution for meshless approximation

  • Kwok T
  • Ling L
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

Abstract

To better approximate nearly singular functions with meshless methods, we propose a data points redistribution method extended from the well-known one-dimensional equidistribution principle. With properly distributed data points, nearly singular functions can be well approximated by linear combinations of global radial basis functions. The proposed method is coupled with an adaptive trial subspace selection algorithm in order to reduce computational cost. In our numerical examples, clear exponential convergence (with respect to the numbers of data points) can be observed. © 2010 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Adaptive greedy algorithm
  • Dual reciprocity method
  • Exponential convergence
  • Meshless interpolation
  • Radial basis function

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Ting On Kwok

  • Leevan Ling

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free