Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls

DOI10.1134/S0965542516050080MaRDI QIDQ327054zbMATH OpenFDO

Authors G. K. Kamenev

Publication date 13 October 2016

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542516050080

zbMATH Keywords

convergence rateconvex bodiesestimate of algorithmsestimate refinement methodfacial structuremultidimensional ballnumerical examplesoptimal methodpolyhedral approximation

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Review text

Polyhedral approximations to convex bodies in \(d\) space dimensions are studied. The convex bodies are required to have smooth boundaries, too. What is of particular interest is the rate of approximation of the mentioned polyhedral approximation. It is known how the measurement of the rate with respect to the number of faces independently of the spatial dimension can be done, in particular for a \(d\)-dimensional ball as a convex body. Even more: these estimates are optimal. In this paper, the so-called estimate refinement method is employed to compute the said approximations and its approximation rate is computed and compared with the previously found rates. Numerical examples are provided, too.

Recommendations

• Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
• Optimal adaptive methods for the polyhedral approximation of convex bodies
• Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
• Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
• scientific article; zbMATH DE number 2124548

Cites work

• Analysis of an algorithm for approximating convex bodies
• Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges
• Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
• Construction of suboptimal coverings of the multidimensional unit sphere
• Efficient algorithms for approximation of nonsmooth convex bodies
• scientific article; zbMATH DE number 4212902 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 3633251 (Why is no real title available?)
• scientific article; zbMATH DE number 480235 (Why is no real title available?)
• scientific article; zbMATH DE number 1105179 (Why is no real title available?)
• scientific article; zbMATH DE number 2008526 (Why is no real title available?)
• scientific article; zbMATH DE number 2124548 (Why is no real title available?)
• scientific article; zbMATH DE number 3282420 (Why is no real title available?)
• scientific article; zbMATH DE number 3286350 (Why is no real title available?)
• Interactive decision maps. Approximation and visualization of Pareto frontier
• Iterative method for constructing coverings of the multidimensional unit sphere
• Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
• Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability
• Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
• Optimal adaptive methods for the polyhedral approximation of convex bodies
• Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies
• Polytopal approximation bounding the number of \(k\)-faces
• The initial convergence rate of adaptive methods for polyhedral approximation of convex bodies
• The upper bound theorem for polytopes: An easy proof of its asymptotic version

Cited in

(9)

• Finding sets of solutions to systems of nonlinear inequalities
• Approximating a solution set of nonlinear inequalities
• Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
• Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
• Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
• The modified method of refined bounds for polyhedral approximation of convex polytopes
• scientific article; zbMATH DE number 5568532 (Why is no real title available?)
• Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
• Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls

This page was built for publication: Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327054)