A matrix decomposition RBF algorithm: Approximation of functions and their derivatives
Date
2007Source
Applied Numerical MathematicsVolume
57Issue
3Pages
304-319Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We propose an efficient algorithm for the approximation of functions and their derivatives using radial basis functions (RBFs). The interpolation points are placed on concentric circles and the resulting matrix has a block circulant structure. We exploit this circulant structure to develop an efficient algorithm for the solution of the resulting system using RBFs. As a result, extremely high accuracy in approximating the given function and its derivatives can be achieved. The given algorithm is also capable of solving large-scale problems with more than 100 000 interpolation points in two dimensions. © 2006 IMACS.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Book Chapter
On completely monotonic and related functions
Koumandos, S. (Springer New York, 2014)We deal with several classes of functions, such as, completely monotonic functions, absolutely monotonic functions, logarithmically completely monotonic functions, Stieltjes functions, and Bernstein functions. We give ...
-
Article
Statistical analysis of multipath fading channels using generalizations of shot noise
Charalambous, Charalambos D.; Djouadi, S. M.; Kourtellaris, C. (2008)This paper provides a connection between the shot-noise analysis of Rice and the statistical analysis of multipath fading wireless channels when the received signals are a low-pass signal and a bandpass signal. Under certain ...
-
Article
Kansa-RBF algorithms for elliptic problems in axisymmetric domains
Karageorghis, Andreas; Chen, C. S.; Liu, X. -Y (2016)We employ a Kansa-radial basis function method for the numerical solution of elliptic boundary value problems in three-dimensional axisymmetric domains. We consider problems governed by the Poisson equation, the inhomogeneous ...