Description of mldivide

DESCRIPTION

MLDIVIDE Set difference

 Set difference

 ---------------------------------------------------------------------------
 DESCRIPTION
 ---------------------------------------------------------------------------
 Computes set difference between P1 and P2

 P1 and P2 can be both single polytopes and polytope arrays

 USAGE:
   R=P\Q
   R=mldivide(P,Q,Options)

 ---------------------------------------------------------------------------
 INPUT
 ---------------------------------------------------------------------------
 P,Q                 - Polytopes or arrays of polytopes
 Options.abs_tol     - absolute tolerance
 Options.lpsolver    - Which LP solver to use (see help mpt_solveLP)
 Options.simplecheck - If set to 1, function aborts as soon as it detects
                       that P1\P2 is non-empty (answers the question: is P1
                       fully covered by P2? answer is true if P1\P2 is empty set)

 Note: If Options is missing or some of the fields are not defined, the default
       values from mptOptions will be used

 ---------------------------------------------------------------------------
 OUTPUT                                                                                                    
 ---------------------------------------------------------------------------
 R   - polytope (or polytope array) describing the set difference

 see also REGIONDIFF

CROSS-REFERENCE INFORMATION

length LENGTH Returns number of regions over which the explicit control law is defined

end END Returns the last element in a given polytope array

isfulldim ISFULLDIM Checks if a polytope is full dimensional

length LENGTH Returns number of elements in a polytope array

polytope POLYTOPE Default constructor for the POLYTOPE object

regiondiff REGIONDIFF Region difference

mpt_error MPT_ERROR Function called if MPT toolbox is not initialized

eq EQ Checks if two polytopes are equal

intersect INTERSECT Intersection of 2 polytopes or polytope arrays

isconvex ISCONVEX Checks if a polytope array forms a convex union

le LE Checks if polytope P is a subset of polytope Q

lt LT Checks if polytope P is a strict subset of polytope Q

minus MINUS Pontryagin difference

mpt_getPWPLyapFct MPT_GETPWPLYAPFCT Calculates Piecewise Polynomial (sum of squares) Lyapunov function

mpt_getPWQLyapFct MPT_GETPWQLYAPFCT Calculates PWQ Lyapunov function

mpt_boolMinTime MPT_BOOLMINTIME Computes minimum time controller for systems with discrete inputs

mldivide

PURPOSE

SYNOPSIS

DESCRIPTION

CROSS-REFERENCE INFORMATION