arXiv subjects
Publications and source records attributed to O. Vlasiuk.
In this paper we study the asymptotic properties of point configurations that achieve optimal covering of sets lacking smoothness. Our results include the proofs of the existence of asymptotics of best covering and maximal polarization for $d$-rectifiable sets and classical fractal sets.
We present an algorithm for producing discrete distributions with a prescribed nearest-neighbor distance function. Our approach is a combination of quasi-Monte Carlo (Q-MC) methods and weighted Riesz energy minimization: the initial distribution is a stratified Q-MC sequence with some modifications; a suitable energy functional on the configuration space is then minimized to ensure local regularity. The resulting node sets are good candidates for building meshless solvers and interpolants, as well as for other purposes where a point cloud with a controlled separation-covering ratio is required. Applications of a three-dimensional implementation of the algorithm, in particular to atmospheric modeling, are also given.