High-dimensional approximation with kernel-based multilevel methods on sparse grids

2024/01/19 by Kempf, Rüdiger, Wendland, Holger
#510

paper · doi:10.15495/epub_ubt_00007423

Abstract

Moderately high-dimensional approximation problems can successfully be solved by combining univariate approximation processes using an intelligent combination technique. While this has so far predominantly been done with either polynomials or splines, we suggest to employ a multilevel kernel-based approximation scheme. In contrast to those schemes built upon polynomials and splines, this new method is capable of combining arbitrary low-dimensional domains instead of just intervals and arbitrarily distributed points in these low-dimensional domains. We introduce the method and analyse its convergence in the so-called isotropic and anisotropic cases.

Related

• Multilevel Sparse Kernel-Based Interpolation
• Fast multilevel sparse Gaussian kernels for high-dimensional approximation and integration
• Numerical Aspects of the Tensor Product Multilevel Method for High-dimensional, Kernel-based Reconstruction on Sparse Grids
• Local and Dimension Adaptive Sparse Grid Interpolation and Quadrature
• Sparse grids vs. random points for high-dimensional polynomial approximation