A Sufficient Condition for the Super-linearization of Polynomial Systems

preprint2023arXivOpen access

Abstract

We provide in this paper a sufficient condition for a polynomial dynamical system x˙(t)=f(x(t))\dot x(t) = f(x(t)) 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 GG, whose nodes viv_i correspond to variables xix_i and edges vivjv_iv_j have weights ∂fj∂xi\frac{\partial f_j}{\partial x_i}. We show that if the product of the edge weights along any cycle in GG 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.