Sandor Veres (University of Sheffield)
Complexity and Error Control in Polytope Computations
It is only in pure mathematics that a hyperplane cuts through a high dimensional polytope without problems of decisions about vertex-facet adjacency. In computations of polytopes for control systems and robotics there are numerical challenges. The talk will review the relevance of the problem in control for bounding methods and will state some results about how to control complexity while remaining useful in engineering solutions.