Computational complexity analysis of set membership identification of Hammerstein and Wiener systems
From MaRDI portal
Publication:2390559
DOI10.1016/J.AUTOMATICA.2008.09.026zbMATH Open1166.93314OpenAlexW1999206215MaRDI QIDQ2390559FDOQ2390559
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
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
computational complexityHammerstein systemsnonlinear identificationWiener systemsset membership identification
Cites Work
- A blind approach to the Hammerstein-Wiener model identification
- An optimal two-stage identification algorithm for Hammerstein-Wiener nonlinear systems
- Linear and nonlinear system identification using separable least-squares
- Convergence analysis of recursive identification algorithms based on the nonlinear Wiener model
- Identifying MIMO Wiener systems using subspace model identification methods
- A two-stage algorithm for identification of nonlinear dynamic systems
- Parameter bounds for discrete-time hammerstein models with bounded output errors
- Approximation of the feasible parameter set in worst-case identification of Hammerstein models
- Frequency domain identification of Wiener models
- Subspace based approaches for Wiener system identification
- Bounding the Parameters of Linear Systems With Input Backlash
- Decoupling the linear and nonlinear parts in Hammerstein model identification
- Title not available (Why is that?)
- Continuous-time Hammerstein system identification
- Frequency domain identification of hammerstein models
- Nonparametric identification of Wiener systems
- Identification of approximated hammerstein models in a worst-case setting
- Bandpass nonlinear systems identification by higher order cross correlation
Cited In (5)
- Kernel‐based regularization least squares algorithm for nonlinear time‐delayed systems using self‐organizing maps
- 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
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)
