Related papers: Eigensets of switching dynamical systems
We consider path-connected sets of matrices and the induced paths between eigenvalues. We discuss the equivalence relation generated by these paths, and how it relates to the presence of higher multiplicity eigenvalues realized by the set.…
In this work, we propose a new framework for reachable set computation through continuous evolution of a set of parameters and offsets which define a parametope, through the intersection of constraints. This results in a dynamical approach…
This paper demonstrates the existence of a finite set of equilibria in the case of the indeterminacy of linear rational expectations models. The number of equilibria corresponds to the number of ways to select n eigenvectors among a larger…
We consider discrete-time switching systems composed of a finite family of affine sub-dynamics. First, we recall existing results and present further analysis on the stability problem, the existence and characterization of compact…
Determining the reachable set for a given nonlinear control system is crucial for system control and planning. However, computing such a set is impossible if the system's dynamics are not fully known. This paper is motivated by a scenario…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
Efficiently handling time-triggered and possibly nondeterministic switches for hybrid systems reachability is a challenging task. In this paper we present an approach based on conservative set-based enclosure of the dynamics that can handle…
We approximate the backward reachable set of discrete-time autonomous polynomial systems using the recently developed occupation measure approach. We formulate the problem as an infinite-dimensional linear programming (LP) problem on…
In this paper, we study the dynamical behavior of a linear control system on $\R^2$ when the associated matrix has real eigenvalues. Different from the complex case, we show that the position of the control zero relative to the control…
Results regarding probable bifurcations from fixed points are presented in the context of general dynamical systems (real, random matrices), time-delay dynamical systems (companion matrices), and a set of mappings known for their properties…
This note deals with a simultaneous approximation of several matrices by a finite family of diagonalizable matrices satisfying an additional condition for the spectrum of a matrix product. That is the simplicity of all eigenvalues.
Given a self-map of a compact metric space $X$, we study periodic points of the map induced on the hyperspace of closed subsets of $X$. We give some necessary conditions on admissible sets of periods for these maps. Seemingly unrelated to…
We analyze statistical properties of complex eigenvalues of random matrices $\hat{A}$ close to unitary. Such matrices appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with…
Eigenvectors associated with non-degenerate eigenvalues are shown to correspond to columns of the adjugate of the characteristic matrix. Degenerate eigenvalues are associated with eigenvectors that correspond to reduced complement tensors…
The attracting set and the inverse limit set are important objects associated to a self-map on a set. We call \emph{stable set} of the self-map the projection of the inverse limit set. It is included in the attracting set, but is not equal…
We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…
The aim of this note is to provide a conceptually simple demonstration of the fact that repetitive model sets are characterized as the repetitive Meyer sets with an almost automorphic associated dynamical system.
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
We present a method of cones for rigorous estimations of eigenvectors, eigenspaces and eigenvalues of a matrix. The key notion is the cone-domination and is inspired by ideas from hyperbolic dynamical systems. We present theorems which…
The problem of computing the reachable set for a given system is a quintessential question in nonlinear control theory. While previous work has yielded a plethora of approximate and analytical methods for determining such a set, these…