Comparison of LPV and nonlinear system theory: A realization problem

The paper explores the utilization of the nonlinear realization theory to address the problem of transforming linear parameter-varying input–output (LPV-IO) equations into a state-space form with static dependence on the so-called scheduling parameter. The necessary and sufficient solvability conditions are given, and three additional subclasses of LPV-IO equations are suggested that are guaranteed to have a realization of the considered type.