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

DOI10.1016/J.AUTOMATICA.2008.09.026MaRDI QIDQ2390559zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• One-shot set-membership identification of generalized Hammerstein-Wiener systems
• On the identification of Hammerstein-Wiener systems
• Set membership identification of nonlinear systems
• Optimality, approximation, and complexity in set membership H/sub ∞/ identification
• Complexity, convergence and computational efficiency for system identification algorithms
• On the identification of Hammerstein systems
• Computational algorithms for multiscale identification of nonlinearities in Hammerstein systems with random inputs
• Set Membership Identification of Linear Systems With Guaranteed Simulation Accuracy
• Convergence of fixed-point iteration for the identification of Hammerstein and Wiener systems
• A recursive identification method for a class of Hammerstein-Wiener systems

Cites work

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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390559)