Low complexity methods for discretizing manifolds via Riesz energy minimization

preprint2013arXivOpen access

Abstract

Let AA be a compact dd-rectifiable set embedded in Euclidean space $\RR^p$, d≤pd\le p. For a given continuous distribution σ(x)σ(x) with respect to dd-dimensional Hausdorff measure on AA, our earlier results provided a method for generating NN-point configurations on AA that have asymptotic distribution σ(x)σ(x) as N→∞N\to \infty; moreover such configurations are "quasi-uniform" in the sense that the ratio of the covering radius to the separation distance is bounded independent of NN. The method is based upon minimizing the energy of NN particles constrained to AA interacting via a weighted power law potential w(x,y)∣x−y∣−sw(x,y)|x-y|^{-s}, where s>ds>d is a fixed parameter and w(x,y)=(σ(x)σ(y))−(s/2d)w(x,y)=\left(σ(x)σ(y)\right)^{-({s}/{2d})}. Here we show that one can generate points on AA with the above mentioned properties keeping in the energy sums only those pairs of points that are located at a distance of at most rN=CNN−1/dr_N=C_N N^{-1/d} from each other, with CNC_N being a positive sequence tending to infinity arbitrarily slowly. To do this we minimize the energy with respect to a varying truncated weight $v_N(x,y)=Φ\(\left|x-y\right|/r_N\)w(x,y)$, where Φ:(0,∞)→[0,∞)Φ:(0,\infty)\to [0,\infty) is a bounded function with Φ(t)=0Φ(t)=0, t≥1t\geq 1, and lim⁡t→0+Φ(t)=1\lim_{t\to 0^+}Φ(t)=1. This reduces, under appropriate assumptions, the complexity of generating NN point `low energy' discretizations to order NCNdN C_N^d computations.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.