2011
DOI: 10.1137/09076756x
|View full text |Cite
|
Sign up to set email alerts
|

Stable Computations with Gaussian Radial Basis Functions

Abstract: Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in nontrivial geometries since the method is mesh-free and can be spectrally accurate. A perceived practical obstacle is that the interpolation matrix becomes increasingly illconditioned as the RBF shape parameter becomes small, corresponding to flat RBFs. Two stable approaches that overcome this problem exist: the Contour-Padé method and the RBF-QR method. However, the former is limited to small node sets… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
284
0
1

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 352 publications
(290 citation statements)
references
References 30 publications
5
284
0
1
Order By: Relevance
“…In e.g. [7,12,14,13], the authors have introduced and further developed a series of so-called "stable algorithms" that overcome the trade-off principle. In such methods, the linear system (3.9) is not solved directly, thus allowing stable computations also when the shape parameter is very small.…”
Section: On Choosing a Good Shape Parametermentioning
confidence: 99%
“…In e.g. [7,12,14,13], the authors have introduced and further developed a series of so-called "stable algorithms" that overcome the trade-off principle. In such methods, the linear system (3.9) is not solved directly, thus allowing stable computations also when the shape parameter is very small.…”
Section: On Choosing a Good Shape Parametermentioning
confidence: 99%
“…This uncertainty principle, however, is tied directly to the use of the standard ("bad") basis, and we demonstrate below how it can be circumvented by choosing a better -orthonormal -basis. The following discussion is motivated by the recent work of Bengt Fornberg and his collaborators [14,15] in which they have proposed a so-called RBF-QR algorithm which allows for stable RBF computations. In addition to this QR-based approach they have also proposed other stable algorithms such as the Contour-Padé algorithm [16].…”
Section: Stable Computationmentioning
confidence: 99%
“…Since the eigenvalues of the Gaussian kernel decay very quickly we are now able to directly follow the QR-based strategy suggested in [14] -without the need for any additional transformation to Chebyshev polynomials.…”
Section: The Rbf-qr Algorithmmentioning
confidence: 99%
See 2 more Smart Citations