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

From MaRDI portal
Publication:2147453

DOI10.1007/S10915-022-01818-7zbMATH Open1493.65030arXiv2107.03112OpenAlexW3183018414MaRDI QIDQ2147453FDOQ2147453

F. Marchetti, Emma Perracchione

Publication date: 20 June 2022

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

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.


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




Recommendations




Cites Work


Cited In (1)

Uses Software





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)