Optimal design for kernel interpolation: applications to uncertainty quantification

04/13/2021
by   Akil Narayan, et al.
0

The paper is concerned with classic kernel interpolation methods, in addition to approximation methods that are augmented by gradient measurements. To apply kernel interpolation using radial basis functions (RBFs) in a stable way, we propose a type of quasi-optimal interpolation points, searching from a large set of candidate points, using a procedure similar to designing Fekete points or power function maximizing points that use pivot from a Cholesky decomposition. The proposed quasi-optimal points result in a smaller condition number, and thus mitigates the instability of the interpolation procedure when the number of points becomes large. Applications to parametric uncertainty quantification are presented, and it is shown that the proposed interpolation method can outperform sparse grid methods in many interesting cases. We also demonstrate the new procedure can be applied to constructing gradient-enhanced Gaussian process emulators.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/13/2020

Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification

This paper deals with the kernel-based approximation of a multivariate p...
12/16/2019

Kernel-based interpolation at approximate Fekete points

We construct approximate Fekete point sets for kernel-based interpolatio...
01/28/2021

Faster Kernel Interpolation for Gaussian Processes

A key challenge in scaling Gaussian Process (GP) regression to massive d...
07/07/2021

Efficient Reduced Basis Algorithm (ERBA) for kernel-based approximation

The main purpose of this work is the one of providing an efficient schem...
07/15/2020

An unfitted RBF-FD method in a least-squares setting for elliptic PDEs on complex geometries

Radial basis function generated finite difference (RBF-FD) methods for P...
12/09/2019

An adaptive high-order piecewise polynomial based sparse grid collocation method with applications

This paper constructs adaptive sparse grid collocation method onto arbit...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.