Efficient reduced basis algorithm (ERBA) for kernel-based approximation

DOI10.1007/S10915-022-01818-7MaRDI QIDQ2147453zbMATH OpenOpenAlexFDO

Authors F. Marchetti, Emma Perracchione

Publication date 20 June 2022

Published in Journal of Scientific Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2107.03112

zbMATH Keywords

efficient knot removal schemeskernelsRBF approximationreduced basis models

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Numerical computation using splines (65D07) Numerical smoothing, curve fitting (65D10) Algorithms for approximation of functions (65D15)

Abstract: The main purpose of this work is the one of providing an efficient scheme for constructing reduced interpolation models for kernel bases. In literature such problem is mainly addressed via the well-established knot insertion or knot removal schemes. Such iterative strategies are usually quite demanding from a computational point of view and our goal is to study an efficient implementation for data removal approaches, namely Efficient Reduced Basis Algorithm (ERBA). Focusing on kernel-based interpolation, the algorithm makes use of two iterative rules for removing data. The former, called ERBA-r, is based on classical residual evaluations. The latter, namely ERBA-p, is independent of the function values and relies on error bounds defined by the power function. In both cases, inspired by the so-called extended Rippa's algorithm, our ERBA takes advantage of a fast implementation.

Recommendations

• Bases for kernel-based spaces
• Kernel \(B\)-splines and interpolation
• Multilevel sparse kernel-based interpolation
• Hierarchical matrix approximation for kernel-based scattered data interpolation
• Spectral approach for kernel-based interpolation

Cites work

• A greedy non-intrusive reduced order model for shallow water equations
• A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
• Adaptive residual subsampling methods for radial basis function interpolation and collocation problems
• An algorithm for selecting a good value for the parameter \(c\) in radial basis function interpolation
• Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
• Feature augmentation for the inversion of the Fourier transform with limited data
• scientific article; zbMATH DE number 177323 (Why is no real title available?)
• scientific article; zbMATH DE number 822266 (Why is no real title available?)
• Kernel-based approximation methods using MATLAB
• Learning via variably scaled kernels
• Meshfree approximation methods with Matlab. With CD-ROM.
• Near-optimal data-independent point locations for radial basis function interpolation
• On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
• On the search of the shape parameter in radial basis functions using univariate global optimization methods
• Scattered Data Approximation
• Scattered data interpolation on embedded submanifolds with restricted positive definite kernels: Sobolev error estimates
• Surrogate modeling of multiscale models using kernel methods
• The extension of Rippa's algorithm beyond LOOCV

Cited in

(1)

• Data-Driven Kernel Designs for Optimized Greedy Schemes: A Machine Learning Perspective

Describes a project that uses

Uses Software

• Matlab
• GaussQR

This page was built for publication: Efficient reduced basis algorithm (ERBA) for kernel-based approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147453)