Cyclic AFD algorithm for the best rational approximation
From MaRDI portal
Recommendations
- An enhancement algorithm for cyclic adaptive Fourier decomposition
- Best two-parameter rational approximation algorithm of given order: a variation of adaptive Fourier decomposition
- Adaptive Fourier decompositions and rational approximations. I: Theory
- scientific article; zbMATH DE number 4188415
- Optimal approximation by Blaschke forms
Cites work
- A criterion for uniqueness of a critical point in \(H_ 2\) rational approximation
- 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
- Adaptive greedy approximations
- Algorithm of Adaptive Fourier Decomposition
- Asymptotic uniqueness of best rational approximants of given degree to Markov functions in \({\mathcal L}^2\) of the circle
- Critical points and error rank in best H₂ matrix rational approximation of fixed McMillan degree
- Identification and rational L^ 2 approximation: A gradient algorithm
- Intrinsic mono-component decomposition of functions: an advance of Fourier theory
- Matrix RationalH2Approximation: A Gradient Algorithm Based on Schur Analysis
- Non-uniqueness of rational best approximants
- Optimal approximation by Blaschke forms
- Rational approximation in the real Hardy space \(H_ 2\) and Stieltjes integrals: A uniqueness theorem
Cited in
(24)- Constructions of -mono-components and mathematical analysis on signal decomposition algorithm
- A stochastic sparse representation: n-best approximation to random signals and computation
- Best kernel approximation in Bergman spaces
- Data-driven ILC algorithms using AFD in frequency domain for unknown linear discrete-time systems
- Positive-instantaneous frequency and approximation
- Analytic phase retrieval based on intensity measurements
- An enhancement algorithm for cyclic adaptive Fourier decomposition
- The AFD methods to compute Hilbert transform
- Adaptive orthonormal systems for matrix-valued functions
- A theory on non-constant frequency decompositions and applications
- Best two-parameter rational approximation algorithm of given order: a variation of adaptive Fourier decomposition
- Greedy Algorithms and Rational Approximation in One and Several Variables
- Optimal approximation by Blaschke forms
- The AAAtrig Algorithm for Rational Approximation of Periodic Functions
- 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
- A novel image encryption scheme with adaptive Fourier decomposition
- Adaptive Fourier decompositions and rational approximations. I: Theory
- A direct proof for the existence of best approximation of random signals
- Extracting outer function part from Hardy space function
- Complete dictionary type stochastic sparse representation and its applications in random process simulation
This page was built for publication: Cyclic AFD algorithm for the best rational approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417258)
