Skip Navigation


IMA Journal of Mathematical Control and Information Advance Access originally published online on May 15, 2007
IMA Journal of Mathematical Control and Information 2008 25(1):123-139; doi:10.1093/imamci/dnm016
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
25/1/123    most recent
dnm016v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kotsios, S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The author 2007. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Open-loop linearization of non-linear discrete input–output systems through simplification algorithms

Stelios Kotsios{dagger}

Department of Economics, Division of Mathematics and Computer Science, University of Athens, Pesmazoglou 8, 10559 Athens, Greece

{dagger} Email: skotsios{at}econ.uoa.gr

Received on May 24, 2006; The problem of linear equivalence for a general class of non-linear systems is examined throughout this paper. A relevant algorithm is developed based on a factorization procedure. This factorization is based on the star product, an operation corresponding to the cascade connection of systems.

Keywords: non-linear; discrete; factorization; algebraic geometry; computational; linearization; simplification; open-loop systems.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.