Approximation of completely bounded sets by the deep holes method. (Q1395176)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1940582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of completely bounded sets by the deep holes method. |
scientific article; zbMATH DE number 1940582 |
Statements
Approximation of completely bounded sets by the deep holes method. (English)
0 references
29 June 2003
0 references
This paper is devoted to the deep holes method (DHM), which is a universal adaptive iteration method for the approximation of completely bounded sets in arbitrary metric spaces. The method is based on the construction of nearly optimal metric \(\varepsilon\)-nets and \(\varepsilon\)-distinguishable subsets. For a prescribed cardinality of a metric \(\varepsilon\)-net, the DHM is shown to construct an approximation, with the radius of the covering balls being, at most, twice as large as the minimum possible radius. Ref. 12 in number
0 references
approximation
0 references
bounded set
0 references
deep holes method
0 references
metric space
0 references
\(\varepsilon\)-net
0 references
covering
0 references
packing
0 references
iteration
0 references
0.7261474132537842
0 references
0.7059813141822815
0 references
0.698913037776947
0 references
0.6975005865097046
0 references
