Pages that link to "Item:Q458854"
From MaRDI portal
The following pages link to On backward shift algorithm for estimating poles of systems (Q458854):
Displaying 15 items.
- System identification by discrete rational atoms (Q889002) (← links)
- A stochastic sparse representation: \(n\)-best approximation to random signals and computation (Q1979920) (← links)
- Reproducing kernel sparse representations in relation to operator equations (Q1984639) (← links)
- MIMO frequency domain system identification using matrix-valued orthonormal functions (Q2065228) (← links)
- System identification of Hammerstein models by using backward shift algorithm (Q2246467) (← links)
- Identification of discrete Hammerstein systems by using adaptive finite rational orthogonal basis functions (Q2279609) (← links)
- Rational approximation in a class of weighted Hardy spaces (Q2313056) (← links)
- The AFD methods to compute Hilbert transform (Q2344464) (← links)
- FFT formulations of adaptive Fourier decomposition (Q2360717) (← links)
- Two‐dimensional adaptive Fourier decomposition (Q5739228) (← links)
- \(n\)-best kernel approximation in reproducing kernel Hilbert spaces (Q6051151) (← links)
- Sparse representations of random signals (Q6141480) (← links)
- A new backward shift algorithm for system identification by a good choice of frequencies (Q6583390) (← links)
- Frequency domain identification using adaptive Fourier decomposition method with polynomials (Q6598782) (← links)
- Identification of discrete Wiener systems by using adaptive generalized rational orthogonal basis functions (Q6652025) (← links)
