The DOI matches its Crossref record.
Fast Solution of the Radial Basis Function Interpolation Equations: Domain Decomposition Methods
Abstract
In this paper we consider domain decomposition methods for solving the radial basis function interpolation equations. There are three interwoven threads to the paper. The first thread provides good ways of setting up and solving small- to medium-sized radial basis function interpolation problems. These may occur as subproblems in a domain decomposition solution of a larger interpolation problem. The usual formulation of such a problem can suffer from an unfortunate scale dependence not intrinsic in the problem itself. This scale dependence occurs, for instance, when fitting polyharmonic splines in even dimensions. We present and analyze an alternative formulation, available for all strictly conditionally positive definite basic functions, which does not suffer from this drawback, at least for the very important example previously mentioned. This formulation changes the problem into one involving a strictly positive definite symmetric system, which can be easily and efficiently solved by Cholesky factorization. The second section considers a natural domain decomposition method for the interpolation equations and views it as an instance of von Neumann's alternating projection algorithm. Here the underlying Hilbert space is the reproducing kernel Hilbert space induced by the strictly conditionally positive definite basic function. We show that the domain decomposition method presented converges linearly under very weak nondegeneracy conditions on the possibly overlapping subdomains. The last section presents some algorithmic details and numerical results of a domain decomposition interpolatory code for polyharmonic splines in 2 and 3 dimensions. This code has solved problems with 5 million centers and can fit splines with 10,000 centers in approximately 7 seconds on very modest hardware.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Reconstruction and representation of 3D objects with radial basis functions
Carr, J. C., Beatson, R. K., Cherrie, J. B., Mitchell, T. J., Fright, W. R., McCallum, B. C., & Evans, T. R. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383266 · Cited by 1,852
Self-citationMulti-level partition of unity implicits
Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., & Seidel, H.-P. (2005) · ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05 · doi:10.1145/1198555.1198649 · Cited by 722
Multi-level partition of unity implicits
Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., & Seidel, H.-P. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882293 · Cited by 530
Kernel techniques: From machine learning to meshless methods
Schaback, R., & Wendland, H. (2006) · Acta Numerica · doi:10.1017/s0962492906270016 · Cited by 289
Metadata
- Authors
- Beatson, R. K., Light, W. A., & Billings, S.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2001-01
- Volume
- 22
- Issue
- 5
- Pages
- 1717-1740
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2158127704
- Cited by
- 231
- References
- 0
- FWCI
- 24.44
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast Solution of the Radial Basis Function Interpolation Equations: Domain Decomposition Methods. https://app.cochat.ai/papers/10.1137/s1064827599361771
- The paper
- Beatson, R. K., Light, W. A., & Billings, S. (2001). Fast Solution of the Radial Basis Function Interpolation Equations: Domain Decomposition Methods. SIAM Journal on Scientific Computing. https://doi.org/10.1137/s1064827599361771
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.