Optimal recurrent algorithms for identification of nonstationary plants
From MaRDI portal
Publication:1207481
DOI10.1016/0045-7906(92)90044-EzbMATH Open0789.93044OpenAlexW1978539130MaRDI QIDQ1207481FDOQ1207481
Authors: Yakov Z. Tsypkin, Boris T. Polyak
Publication date: 1 April 1993
Published in: Computers and Electrical Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7906(92)90044-e
Recommendations
Cited In (11)
- Identification of nonstationary models with application to myoelectric signals for controlling electrical stimulation of paraplegics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal finite-dimensional recursive identification in a polynomial output mapping class
- Estimation of non-stationary delay for a linear discrete dynamic plant
- Decomposition identification algorithm
- Title not available (Why is that?)
- Algorithm for adaptive identification of dynamical parametrically nonstationary objects
- Joint identification and accelerated optimization of plants with lag
- Recursive identification algorithms for continuous-time nonlinear plants operating in closed loop
This page was built for publication: Optimal recurrent algorithms for identification of nonstationary plants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207481)