Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls (Q327054): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Georgy K. Kamenev / rank
Normal rank
 
Property / 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.
Property / 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. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Martin D. Buhmann / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65D15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6638079 / rank
 
Normal rank
Property / zbMATH Keywords
 
convex bodies
Property / zbMATH Keywords: convex bodies / rank
 
Normal rank
Property / zbMATH Keywords
 
multidimensional ball
Property / zbMATH Keywords: multidimensional ball / rank
 
Normal rank
Property / zbMATH Keywords
 
polyhedral approximation
Property / zbMATH Keywords: polyhedral approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal method
Property / zbMATH Keywords: optimal method / rank
 
Normal rank
Property / zbMATH Keywords
 
facial structure
Property / zbMATH Keywords: facial structure / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence rate
Property / zbMATH Keywords: convergence rate / rank
 
Normal rank
Property / zbMATH Keywords
 
estimate of algorithms
Property / zbMATH Keywords: estimate of algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
estimate refinement method
Property / zbMATH Keywords: estimate refinement method / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical examples
Property / zbMATH Keywords: numerical examples / rank
 
Normal rank
Property / author
 
Property / author: Georgy K. Kamenev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive decision maps. Approximation and visualization of Pareto frontier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of an algorithm for approximating convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4831898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for approximation of nonsmooth convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The initial convergence rate of adaptive methods for polyhedral approximation of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopal approximation bounding the number of \(k\)-faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of suboptimal coverings of the multidimensional unit sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative method for constructing coverings of the multidimensional unit sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper bound theorem for polytopes: An easy proof of its asymptotic version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194048 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:04, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
scientific article

    Statements

    Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls (English)
    0 references
    13 October 2016
    0 references
    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.
    0 references
    convex bodies
    0 references
    multidimensional ball
    0 references
    polyhedral approximation
    0 references
    optimal method
    0 references
    facial structure
    0 references
    convergence rate
    0 references
    estimate of algorithms
    0 references
    estimate refinement method
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers