Distributed uncertainty quantification of kernel interpolation on spheres

For radial basis function (RBF) kernel interpolation of scattered data, Schaback [Adv. Comput. Math. 3 (1995), pp. 251–264] proved that the attainable approximation error and the condition number of the underlying interpolation matrix cannot be made small simultaneously. He referred to this finding as an “uncertainty relation,” an undesirable consequence of which is that RBF kernel interpolation is susceptible to noisy data. In this paper, we propose and study a distributed interpolation method to manage and quantify the uncertainty brought on by interpolating noisy spherical data of non-negligible magnitude. We also present numerical simulation results showing that our method is practical and robust in handling noisy data from challenging computing environments.

Authors

Institutions

Publication Details

Journal
Mathematics of Computation
Published
2025-03-11
DOI
https://doi.org/10.1090/mcom/4076
Citations
1
Primary Topic
Probabilistic and Robust Engineering Design
Type
article
Field-Weighted Citation Impact
1.40
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed uncertainty quantification of kernel interpolation on spheres

Di Wang, Shaobo Lin, Xingping Sun
1 citations
Mathematics of Computation
Probabilistic and Robust Engineering Design
1.40
article

Distributed uncertainty quantification of kernel interpolation on spheres

Di Wang, Shaobo Lin, Xingping Sun
article en
1 citations

Abstract

For radial basis function (RBF) kernel interpolation of scattered data, Schaback [Adv. Comput. Math. 3 (1995), pp. 251–264] proved that the attainable approximation error and the condition number of the underlying interpolation matrix cannot be made small simultaneously. He referred to this finding as an “uncertainty relation,” an undesirable consequence of which is that RBF kernel interpolation is susceptible to noisy data. In this paper, we propose and study a distributed interpolation method to manage and quantify the uncertainty brought on by interpolating noisy spherical data of non-negligible magnitude. We also present numerical simulation results showing that our method is practical and robust in handling noisy data from challenging computing environments.

Mathematics of ComputationVol. 95(358)
Missouri State University (US), Xi'an Jiaotong University (CN)
Openalex Percentile: Top 18%
Probabilistic and Robust Engineering Design
1.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.