Greedy multiscale kernel algorithms

DOI10.48550/arXiv.2610.21615MaRDI QIDQ7399843zbMATH OpenarXivFDO

Authors Sara Avesani, Armin Iske, Michael Peters, Tizian Wenzel, Michael Multerer

Publication date 2026

Published in arXiv

Tldr We combine multiscale kernel approximation and greedy kernel algorithms into a multiscale construction which converges as fast as its single-scale counterpart while keeping condition numbers fixed throughout all scales.

Full work available at URL https://doi.org/10.48550/arXiv.2610.21615

arXiv classification

math.NA

Cites work

• A greedy non-intrusive reduced order model for shallow water equations
• Adaptive greedy techniques for approximate solution of large RBF systems
• Adaptive RBF-multiscale approximation on bounded domains
• Approximate interpolation with applications to selecting smoothing parameters
• Cambridge Monographs on Applied and Computational Mathematics
• Error estimates and condition numbers for radial basis function interpolation
• Greedy Kernel Approximation for Sparse Surrogate Modeling
• Improved Convergence of Multilevel Moving Least-Squares Approximation
• Improved estimates for condition numbers of radial basis function interpolation matrices
• Kernel-based approximation methods using MATLAB
• Local Regularity Estimation through Sobolev-Scale Norm Profile
• Multiscale analysis in Sobolev spaces on bounded domains
• Multiscale analysis in Sobolev spaces on bounded domains with zero boundary values
• Multiscale analysis in Sobolev spaces on the sphere
• Multiscale scattered data analysis in samplet coordinates
• Multistep scattered data interpolation using compactly supported radial basis functions
• Near-optimal data-independent point locations for radial basis function interpolation
• Nodal Representations for Kernel-Based Multilevel Interpolation
• Norms of inverses and condition numbers for matrices associated with scattered data
• On the convergence of generalized kernel-based interpolation by greedy data selection algorithms
• On the optimal shape parameter for kernel methods: Sharp direct and inverse statements
• On the optimality of target-data-dependent kernel greedy interpolation in Sobolev reproducing kernel Hilbert spaces
• Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
• Sobolev Algorithm for Local Smoothness Analysis (SALSA) via Sharp Direct and Inverse Statements
• Sobolev error estimates and a Bernstein inequality for scattered data interpolation via radial basis functions
• Stability of kernel-based interpolation
• Thinning algorithms for scattered data interpolation

This page was built for publication: Greedy multiscale kernel algorithms

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