About Model Complexity of 2-D Polynomial Discrete Systems: An Algebraic Approach
By means of special operators and operations, the so-called D-operators and the star-product, a special algebraic description for Nonlinear Polynomial Discrete Systems in two dimensions is developed. By using this description we can check if these nonlinear systems are “similar” or “equivalent” with linear systems, in the sense that the evolution of both systems, under the same initial conditions, are related to each other. Different kinds of solutions to the problem seem to determine different degrees of complexity for the original nonlinear systems.
- 3.Kotsios, S. and Lappas, D.1996. A description of 2-Dimensional discrete polynomial dynamics. IMA Journal of Mathematical Control and Information, Vol. 13, 409–428. Google Scholar
- 4.S.T.Glad (1989), “Differential algebraic modeling of nonlinear Systems”, In proceedings of MTNS-89, Amsterdam, 97–105.Google Scholar
- 5.S. Kotsios-D. Lappas “A Stability Result for “Separable” Nonlinear Discrete Systems.” IMA Journal of Mathematical Control and Information, 18, 325–339, (2001).Google Scholar
- 6.S. Kotsios “An Application on Ritt’s Remainder Algorithm to Discrete Polynomial Control Systems.” Journal of Mathematical Control and Information, 18, 19–29, (2001).Google Scholar
- 7.Stelios Kotsios - Dionyssios Lappas “The Nonlinearity of 2-D Discrete Systems. An Algebraic Approach.” Work in progress, (2013).Google Scholar
- 8.Stelios Kotsios, Dionyssios Lappas, “Linear Similarity of Nonlinear Polynomial Discrete Systems. An Algebraic Approach.” Conference of Modern Mathematical Methods in Science and Technology (M3ST), (2012), Kalamata, Greece.Google Scholar