Asymptotic Results for the minimum energy and Best-Packing Problems on Rectifiable Sets
This work studies the behavior of the minimal discrete Riesz s-energy and best-packing distance on rectifiable sets as the cardinality N of point configurations gets large. We extend known asymptotic results for the minimal s-energy on d-dimensional rectifiable manifolds (s>d, d is an integer) to...
Main Author: | Borodachov, Sergiy Volodymyrovych |
---|---|
Other Authors: | Edward Saff |
Format: | Others |
Language: | en |
Published: |
VANDERBILT
2006
|
Subjects: | |
Online Access: | http://etd.library.vanderbilt.edu/available/etd-06212006-125022/ |
Similar Items
-
An asymptotic formula in best approximation /
by: Reyes, Noli N.
Published: (1992) -
Neural computing for minimum set covering and gate-packing problems
by: Chang, Engder
Published: (1993) -
Asymptotic theory for decentralized sequential hypothesis testing problems and sequential minimum energy design algorithm
by: Wang, Yan
Published: (2011) -
The Geometry of Rectifiable and Unrectifiable Sets
by: Donzella, Michael A.
Published: (2014) -
Rectifiability results for some measures in #iota#'3#infinity#
by: Lorent, Andrew
Published: (1999)