Anisotropic Kernel-based Multilevel Interpolation of High-Dimensional Functions on Sparse Grids
Abstract
The tensor product multilevel method (TPML) approximates high-dimensional functions from scattered data on general bounded domains by combining Smolyak's sparse grid construction with the kernel-based multilevel interpolation, coupling the kernel scale to the fill distance at each level so that condition numbers stay uniformly bounded. Its original formulation depended only implicitly on the target function, which precluded numerical evaluation. Using a recent nodal representation of the low-dimensional multilevel operators, we derive an explicit, computable representation of the high-dimensional interpolant. On this basis we prove error estimates in mixed-regularity Sobolev and continuity norms, extending the existing $ L_2 $-theory, and we characterise the full range of anisotropy weights that attain the optimal rate against the number of degrees of freedom. Three explicit weight strategies follow, equilibrating the accuracy, the degrees of freedom, or the cost-benefit ratio. Numerical experiments in up to ten dimensions illustrate the theory.
Related
- Anisotropic Lagrange interpolation on exact spherical triangles
- Stability of Edelstein Hidden-Variable Fractal Interpolation Functions
- Exact barycentric rational interpolation of analytic functions with an application to the Bessel functions
- Space-time finite element interpolation of nonsmooth functions satisfying boundary conditions
- ROOT ISOLATION FOR ANALYTIC FUNCTIONS USING CUBIC HERMITE INTERPOLATION.
BibTeX
@misc{kempf2026anisotropic,
title = {{Anisotropic Kernel-based Multilevel Interpolation of High-Dimensional Functions on Sparse Grids}},
author = {Rüdiger Kempf},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.25828},
eprint = {2609.25828},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.25828},
}
RIS
TY - UNPB
TI - Anisotropic Kernel-based Multilevel Interpolation of High-Dimensional Functions on Sparse Grids
AU - Rüdiger Kempf
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2609.25828
UR - https://arxiv.org/abs/2609.25828
AB - The tensor product multilevel method (TPML) approximates high-dimensional functions from scattered data on general bounded domains by combining Smolyak's sparse grid construction with the kernel-based multilevel interpolation, coupling the kernel scale to the fill distance at each level so that condition numbers stay uniformly bounded. Its original formulation depended only implicitly on the target function, which precluded numerical evaluation. Using a recent nodal representation of the low-dimensional multilevel operators, we derive an explicit, computable representation of the high-dimensional interpolant. On this basis we prove error estimates in mixed-regularity Sobolev and continuity norms, extending the existing $ L_2 $-theory, and we characterise the full range of anisotropy weights that attain the optimal rate against the number of degrees of freedom. Three explicit weight strategies follow, equilibrating the accuracy, the degrees of freedom, or the cost-benefit ratio. Numerical experiments in up to ten dimensions illustrate the theory.
ER -