On iterated interpolation

by   Steffen Börm, et al.

Matrices resulting from the discretization of a kernel function, e.g., in the context of integral equations or sampling probability distributions, can frequently be approximated by interpolation. In order to improve the efficiency, a multi-level approach can be employed that involves interpolating the kernel functions and its approximations multiple times. This article presents a new approach to analyze the error incurred by these iterated interpolation procedures that is considerably more elegant than its predecessors and allows us to treat not only the kernel function itself, but also its derivatives.


page 1

page 2

page 3

page 4


General-purpose kernel regularization of boundary integral equations via density interpolation

This paper presents a general high-order kernel regularization technique...

Kernel-based interpolation at approximate Fekete points

We construct approximate Fekete point sets for kernel-based interpolatio...

Kernel interpolation generalizes poorly

One of the most interesting problems in the recent renaissance of the st...

Kernel Interpolation of High Dimensional Scattered Data

Data sites selected from modeling high-dimensional problems often appear...

Rational kernel-based interpolation for complex-valued frequency response functions

This work is concerned with the kernel-based approximation of a complex-...

A development of Lagrange interpolation, Part I: Theory

In this work, we introduce the new class of functions which can use to s...

Kernel interpolation with continuous volume sampling

A fundamental task in kernel methods is to pick nodes and weights, so as...

Please sign up or login with your details

Forgot password? Click here to reset