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

DOI10.1016/J.JAT.2023.105931MaRDI QIDQ6093301OpenAlexFDO

Authors Luc Pronzato, A. Zhigljavsky

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

greedy algorithmcovering radiuspacking radiusmesh normseparation radiusfill distancemesh-ratioquasi-uniform design

Mathematics Subject Classification ID

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

Abstract: A design is a collection of distinct points in a given set $X$, which is assumed to be a compact subset of $R^d$, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a sequence of nested designs is the smallest upper bound for the mesh-ratios of the designs. We derive a lower bound on this uniformity constant and show that a simple greedy construction achieves this lower bound. We then extend this scheme to allow more flexibility in the design construction.

Recommendations

• Optimal and quasi-optimal designs
• Design efficiency for minimum projection uniform designs with \(q\) levels
• scientific article; zbMATH DE number 4018158
• Inequalities for quasisymmetric designs
• Optimality of balanced designs for minimum norm quadratic unbiased estimation of variance components
• Optimal designs based on the maximum quasi-likelihood estimator
• scientific article; zbMATH DE number 788263

Cites work

• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 1224949 (Why is no real title available?)
• A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
• Approximation theory and algorithms for data analysis
• Clustering to minimize the maximum intercluster distance
• Collecting Spatial Data
• Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
• Discrete energy on rectifiable sets
• Geometric approximation algorithms
• Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
• Interpolation of spatial data. Some theory for kriging
• Kernel techniques: From machine learning to meshless methods
• Meshfree approximation methods with Matlab. With CD-ROM.
• Minimax and maximin space-filling designs: some properties and methods for construction
• Near-optimal data-independent point locations for radial basis function interpolation
• Scattered Data Approximation
• Sobolev bounds on functions with scattered zeros, with applications to radial basis function surface fitting
• Sobolev error estimates and a Bernstein inequality for scattered data interpolation via radial basis functions
• Stability of kernel-based interpolation

Cited in

(7)

• Design efficiency for minimum projection uniform designs with \(q\) levels
• One-dimensional quasi-uniform Kronecker sequences
• Weighted leave-one-out cross validation
• scientific article; zbMATH DE number 6001262 (Why is no real title available?)
• Construction of uniform designs via an adjusted threshold accepting algorithm
• The Sobol' sequence is not quasi-uniform in dimension 2
• scientific article; zbMATH DE number 5630925 (Why is no real title available?)

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

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