No label defined (Q4256863)
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 1320218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1320218 |
Statements
3 August 1999
0 references
approximation by polyhedra
0 references
approximation of convex compact bodies
0 references
algorithm of approaching polyhedra (AAP)
0 references
degree of convergence
0 references
algorithm of estimate correction
0 references
0.9254503
0 references
0.92463815
0 references
0.9177789
0 references
0.9153534
0 references
0.9141049
0 references
0.9112414
0 references
0.91093725
0 references
0.91030675
0 references
The algorithm of approaching polyhedra (AAP), as the algorithm of the approximation of convex compact bodies by polyhedra, is intended for the solution of the following problem. Consider the Euclidean space \(\mathbb R^m\) with scalar product \(\langle\cdot,\cdot\rangle\), norm \(\|\cdot\|\) and distance \((\cdot,\cdot).\) Each convex compact body \(C\subset \mathbb R^m\) is given by the support function \(\rho(u|C)= \max \{\langle u,y\rangle:y\in C\},\) defined on the unit sphere of directions \(S^{m-1}=\{u\in \mathbb R^m: \|u\|=1\}.\) For each convex compact body, it is necessary to construct the sequence of convex solid polyhedra \(P^k\subset\mathbb R^m\) such that \(\lim_{k\to\infty}\delta(P^k,C)=0\), where \(\delta(\cdot,\cdot)\) is the Hausdorff metric. The objective of this booklet is 1) to obtain the degree of convergence and constants describing degree of convergence of AAP with respect to the number of vertices of the approximating polyhedron and to study the dependence of the convergence degree of AAP on the characteristic of the approximated body called approximability; 2) to study the efficiency of AAP on iterations; 3) to compare AAP and the algorithm of estimate correction from the point of view of numbers of vertices of the approximating polyhedron necessary for achievement of some approximation accuracy. It is proved that the approximating polyhedra, received on the scheme of AAP, do not yield on approximation accuracy to the polyhedra, with the same number of vertices, constructed on the scheme of the above-mentioned algorithm. As approximated bodies, the ellipsoids from the spaces \(\mathbb R^3\) and \(\mathbb R^4\) are chosen. In general, 250 ellipsoids, 200 in the space \(\mathbb R^3\) and 50 in the space \(\mathbb R^4,\) are considered.
0 references