A Subalgebraic Procedure for System Identification of a Continuous-Time Polynomial System
暂无分享,去创建一个
[1] Michel Verhaegen,et al. Stochastic theory of continuous-time state-space identification , 1999, IEEE Trans. Signal Process..
[2] Jan H. van Schuppen,et al. Checking Algebraic Reachability of Polynomial and Rational Systems * *This work was partially supported by the GAČR project 13-16764P. , 2017 .
[3] David A. Cox,et al. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .
[4] Jan H. van Schuppen,et al. An Algorithm for System Identification of a Discrete-Time Polynomial System without Inputs , 2015 .
[5] José A. Ramos,et al. Identification of Parameterized Gray-Box State-Space Systems: From a Black-Box Linear Time-Invariant Representation to a Structured One , 2014, IEEE Transactions on Automatic Control.
[6] Heinz Kredel,et al. Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .
[7] Heinz Unbehauen,et al. Continuous-time Approaches to System Identification , 1988 .
[8] Rolf Johansson,et al. Identification of continuous-time models , 1994, IEEE Trans. Signal Process..
[9] J. Nemcová. Structural identifiability of polynomial and rational systems. , 2008, Mathematical biosciences.
[10] M. Fliess,et al. An algebraic framework for linear identification , 2003 .
[11] Jan H. van Schuppen,et al. Realization Theory for Rational Systems: Minimal Rational Realizations , 2010 .