Volume 5, Issue 1
Truncated Gaussian RBF Differences Are Always Inferior to Finite Differences of the Same Stencil Width
DOI:

Commun. Comput. Phys., 5 (2009), pp. 42-60.

Published online: 2009-05

Preview Full PDF 314 694
Export citation
• Abstract

Radial basis functions (RBFs) can be used to approximate derivatives and solve differential equations in several ways. Here, we compare one important scheme to ordinary ﬁnite differences by a mixture of numerical experiments and theoretical Fourier analysis, that is, by deriving and discussing analytical formulas for the error in differentiating exp(ikx) for arbitrary k.‘Truncated RBF differences” are derived from the same strategy as Fourier and Chebyshev pseudospectral methods: Differentiation of the Fourier, Chebyshev or RBF interpolant generates a differentiation matrix that maps the grid point values or samples of a function u(x) into the values of its derivative on the grid. For Fourier and Chebyshev interpolants, the action of the differentiation matrix can be computed indirectly but efﬁciently by the Fast Fourier Transform (FFT). For RBF functions, alas, the FFT is inapplicable and direct use of the dense differentiation matrix on a grid of N points is prohibitively expensive (O(N2)) unless N is tiny. However, for Gaussian RBFs, which are exponentially localized, there is another option, which is to truncate the dense matrix to a banded matrix, yielding “truncated RBF differences”. The resulting formulas are identical in form to ﬁnite differences except for the difference weights. On a grid of spacing h with the RBF as φ(x)=exp(−α2(x/h)2), df dx (0)≈ ∞ ∑ m=1 wm{f(mh)−f(−mh)}, where without approximation wm = (−1)m+12α2/sinh(mα2). We derive explicit formula for the differentiation of the linear function, f(X)≡X, and the errors therein. We show that Gaussian radial basis functions (GARBF), when truncated to give differentiation formulas of stencil width (2M+1), are signiﬁcantly less accurate than (2M)th order ﬁnite differences of the same stencil width. The error of the inﬁnite series (M=∞) decreases exponentially as α→0. However, truncated GARBF series have a second error (truncation error) that grows exponentially as α→0. Even for α∼O(1)b

where the sum of these two errors is minimized, it is shown that the ﬁnite difference formulas are always superior. We explain, less rigorously, why these arguments extend to more general species of RBFs and to an irregular grid. There are, however, a variety of alternative differentiation strategies which will be analyzed in future work, so it is far too soon to dismiss RBFs as a tool for solving differential equations.

• Keywords

• References
• Hide All
View All

@Article{CiCP-5-42, author = {}, title = {Truncated Gaussian RBF Differences Are Always Inferior to Finite Differences of the Same Stencil Width}, journal = {Communications in Computational Physics}, year = {2009}, volume = {5}, number = {1}, pages = {42--60}, abstract = {

Radial basis functions (RBFs) can be used to approximate derivatives and solve differential equations in several ways. Here, we compare one important scheme to ordinary ﬁnite differences by a mixture of numerical experiments and theoretical Fourier analysis, that is, by deriving and discussing analytical formulas for the error in differentiating exp(ikx) for arbitrary k.‘Truncated RBF differences” are derived from the same strategy as Fourier and Chebyshev pseudospectral methods: Differentiation of the Fourier, Chebyshev or RBF interpolant generates a differentiation matrix that maps the grid point values or samples of a function u(x) into the values of its derivative on the grid. For Fourier and Chebyshev interpolants, the action of the differentiation matrix can be computed indirectly but efﬁciently by the Fast Fourier Transform (FFT). For RBF functions, alas, the FFT is inapplicable and direct use of the dense differentiation matrix on a grid of N points is prohibitively expensive (O(N2)) unless N is tiny. However, for Gaussian RBFs, which are exponentially localized, there is another option, which is to truncate the dense matrix to a banded matrix, yielding “truncated RBF differences”. The resulting formulas are identical in form to ﬁnite differences except for the difference weights. On a grid of spacing h with the RBF as φ(x)=exp(−α2(x/h)2), df dx (0)≈ ∞ ∑ m=1 wm{f(mh)−f(−mh)}, where without approximation wm = (−1)m+12α2/sinh(mα2). We derive explicit formula for the differentiation of the linear function, f(X)≡X, and the errors therein. We show that Gaussian radial basis functions (GARBF), when truncated to give differentiation formulas of stencil width (2M+1), are signiﬁcantly less accurate than (2M)th order ﬁnite differences of the same stencil width. The error of the inﬁnite series (M=∞) decreases exponentially as α→0. However, truncated GARBF series have a second error (truncation error) that grows exponentially as α→0. Even for α∼O(1)b

where the sum of these two errors is minimized, it is shown that the ﬁnite difference formulas are always superior. We explain, less rigorously, why these arguments extend to more general species of RBFs and to an irregular grid. There are, however, a variety of alternative differentiation strategies which will be analyzed in future work, so it is far too soon to dismiss RBFs as a tool for solving differential equations.

}, issn = {1991-7120}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/cicp/7723.html} }
Copy to clipboard
The citation has been copied to your clipboard