Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system
From MaRDI portal
Publication:445149
DOI10.1016/j.automatica.2012.03.002zbMath1244.93038OpenAlexW2036548092MaRDI QIDQ445149
Publication date: 24 August 2012
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2012.03.002
system identificationgreedy algorithmadaptive algorithmrational approximationfrequency-domain identification
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (31)
FFT formulations of adaptive Fourier decomposition ⋮ A class of iterative greedy algorithms related to Blaschke product ⋮ Data-driven ILC algorithms using AFD in frequency domain for unknown linear discrete-time systems ⋮ Positive-instantaneous frequency and approximation ⋮ Consecutive minimum phase expansion of physically realizable signals with applications ⋮ Sparse representation of approximation to identity ⋮ System identification by discrete rational atoms ⋮ \(n\)-best kernel approximation in reproducing kernel Hilbert spaces ⋮ Algorithm of adaptive Fourier decomposition in H2(ℂ+) ⋮ Robust multiscale analytic sampling approximation to periodic function and fast algorithm ⋮ Sparse representations of random signals ⋮ <scp>Frequency‐domain‐based</scp> iterative learning control utilizing <scp>n‐</scp>best adaptive Fourier decomposition for nonrepetitive unknown iteration‐independent and iteration‐varying discrete time‐delay systems ⋮ On backward shift algorithm for estimating poles of systems ⋮ A Theory on Non-Constant Frequency Decompositions and Applications ⋮ A stochastic sparse representation: \(n\)-best approximation to random signals and computation ⋮ Reproducing kernel sparse representations in relation to operator equations ⋮ System identification of Hammerstein models by using backward shift algorithm ⋮ Two‐dimensional adaptive Fourier decomposition ⋮ Spectra of rational orthonormal systems ⋮ Mathematical theory of signal analysis vs. complex analysis method of harmonic analysis ⋮ Basis pursuit for frequency-domain identification ⋮ Identification of discrete Hammerstein systems by using adaptive finite rational orthogonal basis functions ⋮ Extracting outer function part from Hardy space function ⋮ Best kernel approximation in Bergman spaces ⋮ Rational approximation in a class of weighted Hardy spaces ⋮ MIMO frequency domain system identification using matrix-valued orthonormal functions ⋮ Adaptive decompositions in monogenic reproducing kernel Hilbert spaces of Paley-Wiener type ⋮ Approximation of functions by higher order Szegö kernels I. Complex variable cases ⋮ The AFD methods to compute Hilbert transform ⋮ On sparse representation of analytic signal in Hardy space ⋮ AFD-based ILC designs in frequency domain for linear discrete-time systems
Cites Work
- Unnamed Item
- Laguerre models in problems of approximation and identification of discrete systems
- A class of algorithms for identification in \(\mathcal H_{\infty}\)
- Rational basis functions for robust identification from frequency and time-domain measurements
- Orthonormal basis functions for continuous-time systems and \(L_p\) convergence
- On approximation of stable linear dynamical systems using Laguerre and Kautz functions
- Some remarks on greedy algorithms
- Orthonormal basis functions for modelling continuous-time systems
- On closed sets of rational functions
- Laguerre methods andH∞identification of continuous-time systems
- System identification using Laguerre models
- System identification using Kautz models
- A unifying construction of orthonormal bases for system identification
- Frequency domain identification with generalized orthonormal basis functions
- The fundamental role of general orthonormal bases in system identification
- Orthogonal rational functions for system identification: numerical aspects
This page was built for publication: Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system