Multilevel Sparse Kernel-Based Interpolation

نویسندگان

  • Emmanuil H. Georgoulis
  • Jeremy Levesley
  • Fazli Subhan
چکیده

A multilevel kernel-based interpolation method, suitable for moderately high-dimensional function interpolation problems, is proposed. The method, termed multilevel sparse kernelbased interpolation (MLSKI, for short), uses both level-wise and direction-wise multilevel decomposition of structured (or mildly unstructured) interpolation data sites in conjunction with the application of kernel-based interpolants with different scaling in each direction. The multilevel interpolation algorithm is based on a hierarchical decomposition of the data sites, whereby at each level the detail is added to the interpolant by interpolating the resulting residual of the previous level. On each level, anisotropic radial basis functions are used for solving a number of small interpolation problems, which are subsequently linearly combined to produce the interpolant. MLSKI can be viewed as an extension of d-boolean interpolation (which is closely related to ideas in sparse grid and hyperbolic crosses literature) to kernel-based functions, within the hierarchical multilevel framework to achieve accelerated convergence. Numerical experiments suggest that the new algorithm is numerically stable and efficient for the reconstruction of large data in Rd×R, for d = 2, 3, 4, with tens or even hundreds of thousands data points. Also, MLSKI appears to be generally superior over classical radial basis function methods in terms of complexity, run time and convergence at least for large data sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel sparse kernel-based interpolation using conditionally positive definite radial basis functions

A multilevel sparse kernel-based interpolation (MLSKI) method, suitable for moderately high-dimensional function interpolation problems has been recently proposed in [15]. The method uses both level-wise and direction-wise multilevel decomposition of structured or mildly unstructured interpolation data sites in conjunction with the application of kernel-based interpolants with different scaling...

متن کامل

Robust GRAPPA reconstruction using sparse multi-kernel learning with least squares support vector regression.

Accuracy of interpolation coefficients fitting to the auto-calibrating signal data is crucial for k-space-based parallel reconstruction. Both conventional generalized autocalibrating partially parallel acquisitions (GRAPPA) reconstruction that utilizes linear interpolation function and nonlinear GRAPPA (NLGRAPPA) reconstruction with polynomial kernel function are sensitive to interpolation wind...

متن کامل

An Empirical Interpolation based Fast Summation Method for translation invariant kernels

We derive a Fast Multipole Method (FMM) where a low-rank approximation of the kernel is obtained using the Empirical Interpolation Method (EIM). Contrary to classical interpolationbased FMM, where the interpolation points and basis are fixed beforehand, the EIM is a nonlinear approximation method which constructs interpolation points and basis which are adapted to the kernel under consideration...

متن کامل

Scattered Data Interpolation with Multilevel B-Splines

This paper describes a fast algorithm for scattered data interpolation and approximation. Multilevel B-splines are introduced to compute a C 2 -continuous surface through a set of irregularly spaced points. The algorithm makes use of a coarse-tofine hierarchy of control lattices to generate a sequence of bicubic B-spline functions whose sum approaches the desired interpolation function. Large p...

متن کامل

Interpolating Multilevel Green’s Function with Radial Basis Function and Phase Compensation

As a kernel independent algorithm, multilevel Green’s function interpolation method (MLGFIM) [1] [2] has been developed for electromagnetic problems from low frequency to fullwave simulation. This method inherits the multilevel tree structure of multilevel fast multipole algorithm (MLFMA) and adopts the interpolation technique of pre-corrected fast Fourier transform (PFFT). Compare with other f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2013