Dimension-splitting data points redistribution for meshless approximation

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Kwok, T. O., & Ling, L. (2010). Dimension-splitting data points redistribution for meshless approximation. Journal of Computational and Applied Mathematics, 235(3), 736–746. https://doi.org/10.1016/j.cam.2010.06.026

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free