PARAMETRIC COMPLEXITY REDUCTION OF DISCRETE-TIME LINEAR SYSTEMS HAVING A SLOW INITIAL ONSET OR DELAY
From MaRDI portal
Publication:5011645
DOI10.3846/13926292.2016.1208119zbMath1488.42116OpenAlexW2521349197MaRDI QIDQ5011645
Abdelkader Krifa, Kais Bouzrara
Publication date: 27 August 2021
Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3846/13926292.2016.1208119
Related Items (2)
Analytical solution of optimal Meixner-like pole ⋮ Robust predictive control based on the Meixner-like model
Cites Work
- Approximation based on orthogonal and almost orthogonal functions
- Optimal free parameters in orthonormal approximations
- Online identification of the ARX model expansion on Laguerre orthonormal bases with filters on model input and output
- An optimum time scale for discrete Laguerre network
- Algorithms for Separable Nonlinear Least Squares Problems
- System identification using Laguerre models
- Optimum Laguerre networks for a class of discrete-time systems
- Optimality condition for truncated generalized laguerre networks
- Meixner-like functions having a rational z-transform
- System identification using Kautz models
- Dynamic SISO and MISO system approximations based on optimal Laguerre models
- Separable nonlinear least-squares methods for efficient off-line and on-line modeling of systems using Kautz and Laguerre filters
- Optimum choice of free parameter in orthonormal approximations
- Pertinent choice of parameters for discrete Kautz approximation
- On the Relationship Between the Enforced Convergence Criterion and the Asymptotically Optimal Laguerre Pole
This page was built for publication: PARAMETRIC COMPLEXITY REDUCTION OF DISCRETE-TIME LINEAR SYSTEMS HAVING A SLOW INITIAL ONSET OR DELAY
