An enhancement algorithm for cyclic adaptive Fourier decomposition
From MaRDI portal
Publication:2325546
DOI10.1016/j.acha.2019.01.003zbMath1426.41012arXiv1803.08422OpenAlexW2962680912WikidataQ128536713 ScholiaQ128536713MaRDI QIDQ2325546
Jian-zhong Wang, Weixiong Mai, Tao Qian
Publication date: 26 September 2019
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.08422
Approximation by rational functions (41A20) Numerical methods for discrete and fast Fourier transforms (65T50) Hardy spaces (30H10) Blaschke products (30J10)
Related Items (13)
A class of iterative greedy algorithms related to Blaschke product ⋮ Analytic phase retrieval based on intensity measurements ⋮ Sparse representation of approximation to identity ⋮ \(n\)-best kernel approximation in reproducing kernel Hilbert spaces ⋮ Algorithm of adaptive Fourier decomposition in H2(ℂ+) ⋮ Granular sieving algorithm for selecting best n$$ n $$ parameters ⋮ Collaborative granular sieving: a deterministic multievolutionary algorithm for multimodal optimization problems ⋮ Sparse representations of random signals ⋮ Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes ⋮ 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 ⋮ Best kernel approximation in Bergman spaces
Cites Work
- Unnamed Item
- Unnamed Item
- A fast adaptive model reduction method based on Takenaka-Malmquist systems
- Identification and rational \(L^ 2\) approximation: A gradient algorithm
- A remark on uniqueness of best rational approximants of degree 1 in \(L^2\) of the circle
- Introductory lectures on convex optimization. A basic course.
- Adaptive Fourier series---a variation of greedy algorithm
- Matrix RationalH2Approximation: A Gradient Algorithm Based on Schur Analysis
- Algorithm of Adaptive Fourier Decomposition
- Optimal approximation by Blaschke forms
- Cyclic AFD algorithm for the best rational approximation
This page was built for publication: An enhancement algorithm for cyclic adaptive Fourier decomposition