Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

Dimension-splitting data points redistribution for meshless approximation

Language

English

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.

Keywords

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

Publication Date

2010

Source Publication Title

Journal of Computational and Applied Mathematics

Volume

235

Issue

3

Start Page

736

End Page

746

Publisher

Elsevier

DOI

10.1016/j.cam.2010.06.026

Link to Publisher's Edition

http://dx.doi.org/10.1016/j.cam.2010.06.026

ISSN (print)

03770427

ISSN (electronic)

18791778

This document is currently not available here.

Share

COinS