Finding sets of solutions to systems of nonlinear inequalities (Q1683169): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The modified method of refined bounds for polyhedral approximation of convex polytopes / 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: Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls / 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: Effective hull of a set and its approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of three-dimensional delaunay meshes from weakly structured and inconsistent data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5642440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in Nonlinear Programming / rank
 
Normal rank

Revision as of 20:38, 14 July 2024

scientific article
Language Label Description Also known as
English
Finding sets of solutions to systems of nonlinear inequalities
scientific article

    Statements

    Finding sets of solutions to systems of nonlinear inequalities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2017
    0 references
    This paper presents a method for constructing approximations of the set of solutions to a system of nonlinear inequalities. The method is based on the method of nonlinear coverings. This method generates an interior and exterior approximation of the set of solutions (defined as set of boxes) with a prescribed accuracy. The efficiency of the method is demonstrated by approximating the workspace of a planar parallel robot.
    0 references
    0 references
    0 references
    0 references
    0 references
    method of nonuniform coverings
    0 references
    system of nonlinear inequalities
    0 references
    methods of set approximation
    0 references
    workspace of a robot
    0 references