IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v43y2011i2p319-333.html
   My bibliography  Save this article

Identification of polynomial input/output recursive models with simulation error minimisation methods

Author

Listed:
  • Marcello Farina
  • Luigi Piroddi

Abstract

Polynomial input/output (I/O) recursive models are widely used in nonlinear model identification for their flexibility and representation capabilities. Several identification algorithms are available in the literature, which deal with both model selection and parameter estimation. Previous works have shown the limitations of the classical prediction error minimisation approach in this context, especially (but not only) when the disturbance contribution is unknown, and suggested the use of a simulation error minimisation (SEM) approach for a better selection of the I/O model. This article goes a step further by integrating the model selection procedure with a simulation-oriented parameter estimation algorithm. Notwithstanding the algorithmic and computational complexity of the proposed method, it is shown that it can sometimes achieve great performance improvements with respect to previously proposed approaches. Two different parameter estimation algorithms are suggested, namely a direct SEM optimisation algorithm, and an approximate method based on multi-step prediction iteration, which displays several convenient properties from the computational point of view. Several simulation examples are shown to demonstrate the effectiveness of the suggested SEM approaches.

Suggested Citation

  • Marcello Farina & Luigi Piroddi, 2011. "Identification of polynomial input/output recursive models with simulation error minimisation methods," International Journal of Systems Science, Taylor & Francis Journals, vol. 43(2), pages 319-333.
  • Handle: RePEc:taf:tsysxx:v:43:y:2011:i:2:p:319-333
    DOI: 10.1080/00207721.2010.496055
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2010.496055
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2010.496055?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:43:y:2011:i:2:p:319-333. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.