Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Modeling and Analysis of Hybrid Systems Convex polyhedra
 

Summary: Modeling and Analysis of Hybrid Systems
Convex polyhedra
Prof. Dr. Erika Ábrahám
Informatik 2 - Theory of Hybrid Systems
RWTH Aachen University
SS 2011
Ábrahám - Modeling and Analysis of Hybrid Systems 1 / 1
Contents
Ábrahám - Modeling and Analysis of Hybrid Systems 2 / 1
Polyhedra
Ábrahám - Modeling and Analysis of Hybrid Systems 3 / 1
Convex polyhedra
Definition
A (convex) polyhedron in Rd is the solution set to a finite number of linear
inequalities with real coefficients in d real variables. A bounded polyhedron
is called polytope.
Depending on the form of the representation, we distinguish between
H-polytopes and
V-polytopes.
Ábrahám - Modeling and Analysis of Hybrid Systems 4 / 1

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences