Cyclic AFD algorithm for the best rational approximation

DOI10.1002/mma.2843zbMath1287.42018OpenAlexW2058401677MaRDI QIDQ5417258

Tao Qian

Publication date: 16 May 2014

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.2843

zbMATH Keywords

Hardy spacebest rational approximationBlaschke formmaximal selection principlerational orthonormal system

Mathematics Subject Classification ID

Banach algebras of differentiable or analytic functions, (H^p)-spaces (46J15) (H^p)-spaces (42B30) Numerical methods in Fourier analysis (65T99) Hardy spaces (30H10)

Related Items (19)

Data-driven ILC algorithms using AFD in frequency domain for unknown linear discrete-time systems ⋮ Positive-instantaneous frequency and approximation ⋮ Best two‐parameter rational approximation algorithm of given order: a variation of adaptive Fourier decomposition ⋮ Analytic phase retrieval based on intensity measurements ⋮ 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 ⋮ <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 ⋮ Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes ⋮ Adaptive orthonormal systems for matrix-valued functions ⋮ A novel image encryption scheme with adaptive Fourier decomposition ⋮ A Theory on Non-Constant Frequency Decompositions and Applications ⋮ Constructions of \(\epsilon\)-mono-components and mathematical analysis on signal decomposition algorithm ⋮ Greedy Algorithms and Rational Approximation in One and Several Variables ⋮ A stochastic sparse representation: \(n\)-best approximation to random signals and computation ⋮ Extracting outer function part from Hardy space function ⋮ Best kernel approximation in Bergman spaces ⋮ An enhancement algorithm for cyclic adaptive Fourier decomposition ⋮ The AFD methods to compute Hilbert transform

Cites Work

• 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
• Rational approximation in the real Hardy space \(H_ 2\) and Stieltjes integrals: A uniqueness theorem
• Non-uniqueness of rational best approximants
• A criterion for uniqueness of a critical point in \(H_ 2\) rational approximation
• Critical points and error rank in best \(H_2\) matrix rational approximation of fixed McMillan degree
• Adaptive Fourier series---a variation of greedy algorithm
• Intrinsic mono-component decomposition of functions: An advance of Fourier theory
• Matrix RationalH₂Approximation: A Gradient Algorithm Based on Schur Analysis
• Algorithm of Adaptive Fourier Decomposition
• Optimal approximation by Blaschke forms
• Asymptotic uniqueness of best rational approximants of given degree to Markov functions in \({\mathcal L}^2\) of the circle
• Adaptive greedy approximations

This page was built for publication: Cyclic AFD algorithm for the best rational approximation