Quasi-uniform designs with optimal and near-optimal uniformity constant

DOI10.1016/j.jat.2023.105931arXiv2112.10401OpenAlexW4225479841MaRDI QIDQ6093301

Anatoly A. Zhigljavsky, Luc Pronzato

Publication date: 6 September 2023

Published in: Journal of Approximation Theory (Search for Journal in Brave)

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

zbMATH Keywords

covering radiusgreedy algorithmpacking radiusmesh normseparation radiusfill distancemesh-ratioquasi-uniform design

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability of kernel-based interpolation
• Sobolev error estimates and a Bernstein inequality for scattered data interpolation via radial basis functions
• Clustering to minimize the maximum intercluster distance
• Interpolation of spatial data. Some theory for kriging
• Near-optimal data-independent point locations for radial basis function interpolation
• A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
• Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
• Kernel techniques: From machine learning to meshless methods
• Approximation Theory and Algorithms for Data Analysis
• Sobolev bounds on functions with scattered zeros, with applications to radial basis function surface fitting
• Discrete Energy on Rectifiable Sets
• Collecting Spatial Data
• Convergence rate of the data-independent $P$-greedy algorithm in kernel-based approximation
• Scattered Data Approximation

This page was built for publication: Quasi-uniform designs with optimal and near-optimal uniformity constant