Computational complexity analysis of set membership identification of Hammerstein and Wiener systems

DOI10.1016/J.AUTOMATICA.2008.09.026zbMath1166.93314OpenAlexW1999206215MaRDI QIDQ2390559

Mario Sznaier

Publication date: 23 July 2009

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2008.09.026

zbMATH Keywords

computational complexityHammerstein systemsnonlinear identificationWiener systemsset membership identification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) System identification (93B30)

Related Items (5)

Bounded error identification of Hammerstein systems through sparse polynomial optimization ⋮ Identification of block-oriented nonlinear systems starting from linear approximations: a survey ⋮ One-shot set-membership identification of generalized Hammerstein-Wiener systems ⋮ Kernel‐based regularization least squares algorithm for nonlinear time‐delayed systems using self‐organizing maps ⋮ Gradient based iterative parameter identification for Wiener nonlinear systems

Cites Work

• Unnamed Item
• Identifying MIMO Wiener systems using subspace model identification methods
• Approximation of the feasible parameter set in worst-case identification of Hammerstein models
• A two-stage algorithm for identification of nonlinear dynamic systems
• An optimal two-stage identification algorithm for Hammerstein-Wiener nonlinear systems
• Linear and nonlinear system identification using separable least-squares
• Frequency domain identification of Wiener models
• Decoupling the linear and nonlinear parts in Hammerstein model identification
• A blind approach to the Hammerstein-Wiener model identification
• Bandpass nonlinear systems identification by higher order cross correlation
• Nonparametric identification of Wiener systems
• Convergence analysis of recursive identification algorithms based on the nonlinear Wiener model
• Continuous-time Hammerstein system identification
• Parameter bounds for discrete-time hammerstein models with bounded output errors
• Frequency domain identification of hammerstein models
• Identification of approximated hammerstein models in a worst-case setting
• Subspace based approaches for Wiener system identification
• Bounding the Parameters of Linear Systems With Input Backlash

This page was built for publication: Computational complexity analysis of set membership identification of Hammerstein and Wiener systems