An algorithm for constructing of minimal volume ellipsoid (Q2739958)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for constructing of minimal volume ellipsoid |
scientific article; zbMATH DE number 1646404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for constructing of minimal volume ellipsoid |
scientific article; zbMATH DE number 1646404 |
Statements
16 September 2001
0 references
algorithm
0 references
minimal volume ellipsoid
0 references
elementary polygons
0 references
0.94317234
0 references
0.93188524
0 references
0.93042624
0 references
0.92396486
0 references
0 references
0.9126408
0 references
0.9123859
0 references
0.9079127
0 references
An algorithm for constructing of minimal volume ellipsoid (English)
0 references
The author proposes a new algorithm for constructing the minimal volume ellipsoid which contains the given finite set of points in \(R^{m}\). This algorithm is based on the constructing of a minimal volume ellipsoid for elementary polygons. Here the elementary polygon in \(R^{m}\) is a convex polygon containing from \((m+1)\) to \({1\over 2}m(m+3)+1\) vertices.
0 references
