The AFD methods to compute Hilbert transform
From MaRDI portal
Publication:2344464
DOI10.1016/j.aml.2014.12.017zbMath1325.42002OpenAlexW1974067432MaRDI QIDQ2344464
Tao Qian, Weixiong Mai, Yan Mo, Qiu-hui Chen
Publication date: 15 May 2015
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2014.12.017
Hardy spaceHilbert transformTakenaka-Malmquist systemadaptive Fourier decompositionorthogonal rational system
Trigonometric approximation (42A10) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)
Related Items
The adaptive Fourier decomposition for financial time series ⋮ Algorithm of adaptive Fourier decomposition in H2(ℂ+) ⋮ AAA-least squares rational approximation and solution of Laplace problems ⋮ On computing the analytic-signal backbone of the unforced harmonic oscillator ⋮ Numerical stability of circular Hilbert transform and its application to signal decomposition ⋮ Multichannel interpolation of nonuniform samples with application to image recovery ⋮ Multi-scale analysis of influencing factors for soybean futures price risk: Adaptive Fourier decomposition mathematical model applied for the case of China
Cites Work
- Unnamed Item
- Support vector machine adapted Tikhonov regularization method to solve Dirichlet problem
- Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system
- A fast adaptive model reduction method based on Takenaka-Malmquist systems
- On backward shift algorithm for estimating poles of systems
- Comparison of adaptive mono-component decompositions
- A novel method for computing the Hilbert transform with Haar multiresolution approximation
- Adaptive Fourier series---a variation of greedy algorithm
- Computing the discrete-time "analytic" signal via FFT
- Intrinsic mono-component decomposition of functions: An advance of Fourier theory
- Algorithm of Adaptive Fourier Decomposition
- REMARKS ON ADAPTIVE FOURIER DECOMPOSITION
- Cyclic AFD algorithm for the best rational approximation