An enhancement algorithm for cyclic adaptive Fourier decomposition
From MaRDI portal
Publication:2325546
Abstract: The paper investigates the complex gradient descent method (CGD) for the best rational approximation of a given order to a function in the Hardy space on the unit disk. It is equivalent to finding the best Blaschke form with free poles. The adaptive Fourier decomposition (AFD) and the cyclic AFD methods in literature are based on the grid search technique. The precision of these methods is limited by the grid spacing. The proposed method employs a fast search algorithm to find the initial for CGD, then finds the target poles by gradient descent optimization. Hence, it can reach higher precision with less computation cost. Its validity and effectiveness are confirmed by several examples.
Recommendations
- Cyclic AFD algorithm for the best rational approximation
- Algorithm of adaptive Fourier decomposition in H2(ℂ+)
- Best two-parameter rational approximation algorithm of given order: a variation of adaptive Fourier decomposition
- Adaptive Fourier series---a variation of greedy algorithm
- Adaptive Fourier decompositions and rational approximations. I: Theory
Cites work
- A fast adaptive model reduction method based on Takenaka-Malmquist systems
- A remark on uniqueness of best rational approximants of degree 1 in \(L^2\) of the circle
- Adaptive Fourier series---a variation of greedy algorithm
- Algorithm of Adaptive Fourier Decomposition
- Cyclic AFD algorithm for the best rational approximation
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3019906 (Why is no real title available?)
- Identification and rational L^ 2 approximation: A gradient algorithm
- Introductory lectures on convex optimization. A basic course.
- Matrix RationalH2Approximation: A Gradient Algorithm Based on Schur Analysis
- Optimal approximation by Blaschke forms
Cited in
(19)- Numericalization of the self adaptive spectral rotation method for coding region prediction
- 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
- Analytic phase retrieval based on intensity measurements
- A theory on non-constant frequency decompositions and applications
- Best two-parameter rational approximation algorithm of given order: a variation of adaptive Fourier decomposition
- Sparse representation of approximation to identity
- Cyclic AFD algorithm for the best rational approximation
- \(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
- Sparse series solutions of random boundary and initial value problems
- Adaptive decomposition for matrix-valued functions on polydiscs
- A direct proof for the existence of best approximation of random signals
- A class of iterative greedy algorithms related to Blaschke product
This page was built for publication: An enhancement algorithm for cyclic adaptive Fourier decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325546)
