Optimal finite-dimensional recursive identification in a polynomial output mapping class

DOI10.1016/0167-6911(83)90075-0zbMath0539.93019OpenAlexW2076750946MaRDI QIDQ794579

Markku T. Nihtilä

Publication date: 1983

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(83)90075-0

zbMATH Keywords

polynomial systemsexponential weightingdeterministic least-squares identificationrecursive finite-dimensional estimation

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) System identification (93B30) Nonlinear systems in control theory (93C10) Estimation and detection in stochastic control theory (93E10) Signal detection and filtering (aspects of stochastic processes) (60G35) Model systems in control theory (93C99)

Related Items (3)

On exponential convergence and robustness of least-squares identification ⋮ Identification of partially-known systems ⋮ Identification of time delays using a polynomial identification method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential convergence of recursive last squares with exponential forgetting factor
• Optimal finite-dimensional solution for a class of nonlinear observation problems
• Finite Dimensional Deterministic Nonlinear Filters via Riccati Transformation and Volterra Series
• Exact finite-dimensional filters for certain diffusions with nonlinear drift
• Algebraic Structure and Finite Dimensional Nonlinear Estimation

This page was built for publication: Optimal finite-dimensional recursive identification in a polynomial output mapping class