[BOOK][B] Efficient sampling geometries and reconstruction algorithms for estimation of diffusion propagators

W Ye - 2012 - search.proquest.com
… of zonotopes to derive the inverse Fourier transform of indicator functions of general zonotopes
… As we will see in what follows, symmetric polygons happen to be 2-D zonotopes and our …

[PDF][PDF] Reachability for Continuous and Hybrid Systems.

O Maler - RP, 2009 - sti.uniurb.it
… ► Initially used zonotopes, a class of sets closed under both linear operations and Minkowski
sum; Can be applied to any “lazy” representation of the sequence of the computed sets …

Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems

S Kaynama, M Oishi - International Journal of Control, 2011 - Taylor & Francis
This article presents a method for complexity reduction in reachability analysis and safety-preserving
controller synthesis via Schur-based decomposition. The decomposition results in …

Recognizing conic TDI systems is hard

J Pap - Mathematical programming, 2011 - Springer
In this note we prove that the problem of deciding whether or not a set of integer vectors forms
a Hilbert basis is co-NP-complete. Equivalently, deciding whether a conic linear system is …

Right-angularity, flag complexes, asphericity

MW Davis - Geometriae Dedicata, 2012 - Springer
The “polyhedral product functor” produces a space from a simplicial complex L and a
collection of pairs of spaces, {(A(i), B(i))}, where i ranges over the vertex set of L. We give …

Topological obstructions for vertex numbers of Minkowski sums

R Sanyal - Journal of Combinatorial Theory, Series A, 2009 - Elsevier
We show that for polytopes P 1 , P 2 , … , P r ⊂ R d , each having n i ⩾ d + 1 vertices, the
Minkowski sum P 1 + P 2 + ⋯ + P r cannot achieve the maximum of ∏ i n i vertices if r ⩾ d . This …

Schur-based decomposition for reachability analysis of linear time-invariant systems

S Kaynama, M Oishi - Proceedings of the 48h IEEE Conference …, 2009 - ieeexplore.ieee.org
We present a method for complexity reduction in reachability analysis and controller
synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either …

Polynomially solvable cases of binary quadratic programs

D Li, X Sun, S Gu, J Gao, C Liu - Optimization and Optimal Control, 2010 - Springer
… We now discuss how to enumerate all the extreme points of the zonotope Z(V). Let v j denote
the jth column vector of V. Assume that the regularity condition is satisfied for the zonotope Z…

Set membership state and parameter estimation for nonlinear differential equations with sparse discrete measurements

SW Marvel, CM Williams - 2012 IEEE International Conference …, 2012 - ieeexplore.ieee.org
This paper presents a method to perform parameter and state estimation in a bounded-error
context for nonlinear continuous-time systems with sparse, discrete measurements. Direct …