… Section 4 establishes a link between these reduced rank QIP problems and the problem
of enumerating the vertices of a zonotope. Section 5 incorporates the semidefinite relaxation …

… In Figure 1, we show zonotopes for Z1(E) and Z2(E) for the use of this code in BSC with
probabilities of error p1 = 0.1 and p2 = 0.2, for the first information bit. It is obvious that the Z1(E) …

We identify parameters of a given input-output model so that estimated model output is consistent
with the measured output of the system modeled. Parameter estimation based on a set-…

… This procedure generates the strip constraints S,, which describe the relationships between
all model relations and define the Cartesian equations of the frontiers of the zonotope. …

… the zonotopes. It can be chosen freely and is a performance parameter for the Kuhn's algorithm.
Given the zonotope … the set of estimated states X(k)is enclosed by the following zonotope …

We consider n-dimensional real Banach spaces X which are far, in the Banach–Mazur distance,
from all complemented subspaces of all Banach lattices. We show that this is related to …

… work to zonotope … zonotope computations to compute the reach sets. Thus, over-approximations
of Reach(Su, X0,t) can be efficiently computed by combining our method with zonotope …

A central-symmetric three-dimensional model of the sixdimensional cube can give us the
idea of filling the space with mosaics of zonotopes. This model yields also plane tilings by its …

… Every equation error is bounded while parameters fluctuate inside a time-invariant domain
represented by a zonotope. The proposed method helps to find the characteristics of this …

… zonotopes, and the simple zonotopes among them correspond to a very restrictive class of
graphs that are easily dealt with. A zonotope … define the associated graphic zonotope ZG to be …