arXiv:1507.02246 [math.OC]AbstractReferencesReviewsResources
An Algorithm for System Identification of a Discrete-Time Polynomial System without Inputs
Jana Němcová, Mihály Petreczky, Jan H. van Schuppen
Published 2015-07-08Version 1
A subalgebraic approximation algorithm is proposed to estimate from a set of time series the parameters of the observer representation of a discrete-time polynomial system without inputs which can generate an approximation of the observed time series. A major step of the algorithm is to construct a set of generators for the polynomial function from the past outputs to the future outputs. For this singular value decompositions and polynomial factorizations are used. An example is provided.
Comments: IFAC Symposium System Identification 2015. The arxiv report is equal to the initial conference submission, except for the last two words of the title
Categories: math.OC
Subjects: 93B30
Keywords: discrete-time polynomial system, system identification, time series, subalgebraic approximation algorithm, singular value decompositions
Tags: conference paper
Related articles: Most relevant | Search more
arXiv:2304.05093 [math.OC] (Published 2023-04-11)
Generative modeling for time series via Schr{ö}dinger bridge
arXiv:0905.1862 [math.OC] (Published 2009-05-12)
Optimal Quantization of Signals for System Identification
arXiv:1009.5614 [math.OC] (Published 2010-09-28)
Input Design for System Identification via Convex Relaxation