Abstract

AbstractWe propose a new method, namely an eigen-rational kernel-based scheme, for multivariate interpolation via mesh-free methods. It consists of a fractional radial basis function (RBF) expansion, with the denominator depending on the eigenvector associated to the largest eigenvalue of the kernel matrix. Classical bounds in terms of Lebesgue constants and convergence rates with respect to the mesh size of the eigen-rational interpolant are indeed comparable with those of classical kernel-based methods. However, the proposed approach takes advantage of rescaling the classical RBF expansion providing more robust approximations. Theoretical analysis, numerical experiments and applications support our findings.

Highlights

  • Multivariate approximation is one of the most investigated topics in applied mathematics and finds applications in a wide variety of fields

  • Nowadays many positive definite functions are classified as Radial Basis Functions (RBFs), a new term that appears for the first time on a publication by N

  • We propose a new approach, namely what we call the eigenrational method, which is extended to work with conditionally positive definite kernels and enables us to define a rational RBF expansion depending exclusively on kernel and data

Read more

Summary

Introduction

Multivariate approximation is one of the most investigated topics in applied mathematics and finds applications in a wide variety of fields. We propose a new approach, namely what we call the eigenrational method, which is extended to work with conditionally positive definite kernels and enables us to define a rational RBF expansion depending exclusively on kernel and data Speaking, it consists in rescaling the classical RBF interpolant, taking into account the eigenvector associated to the largest eigenvalue of the kernel matrix. Despite the fact that from the analysis of Lebesgue functions and error bounds it turns out that the eigen-rational method behaves to classical kernel-based interpolants, weighting the interpolant by means of such eigenvector numerically provides more accurate approximations Such a phenomenon is evident for RBFs characterized by a fast decay, such as the Gaussian.

Review of kernel-based interpolation
Well-posed problems
Error bounds
Eigen-rational Kernel-based interpolation
The eigen-rational interpolant
Stability analysis
Error analysis
Error estimates
Numerical experiments
Experiments for Lebesgue functions and constants
Experiments for convergence and error estimates
Test with real data: application to image registration
Conclusions and work in progress
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.