Abstract
We provide in this paper a sufficient condition for a polynomial dynamical system to be super-linearizable, i.e., to be such that all its trajectories are linear projections of the trajectories of a linear dynamical system. The condition is expressed in terms of the hereby introduced weighted dependency graph , whose nodes correspond to variables and edges have weights . We show that if the product of the edge weights along any cycle in is a constant, then the system is super-linearizable. The proof is constructive, and we provide an algorithm to obtain super-linearizations and illustrate it on an example.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.