Pages that link to "Item:Q5417258"

The following pages link to Cyclic AFD algorithm for the best rational approximation (Q5417258):

Displaying 18 items.

• Extracting outer function part from Hardy space function (Q724436) (← links)
• Constructions of \(\epsilon\)-mono-components and mathematical analysis on signal decomposition algorithm (Q1737191) (← links)
• A stochastic sparse representation: \(n\)-best approximation to random signals and computation (Q1979920) (← links)
• Best kernel approximation in Bergman spaces (Q2060205) (← links)
• Data-driven ILC algorithms using AFD in frequency domain for unknown linear discrete-time systems (Q2125326) (← links)
• Positive-instantaneous frequency and approximation (Q2141328) (← links)
• Analytic phase retrieval based on intensity measurements (Q2154597) (← links)
• An enhancement algorithm for cyclic adaptive Fourier decomposition (Q2325546) (← links)
• The AFD methods to compute Hilbert transform (Q2344464) (← links)
• Adaptive Fourier decompositions and rational approximations, part I: Theory (Q2930112) (← links)
• Adaptive orthonormal systems for matrix-valued functions (Q2964040) (← links)
• A Theory on Non-Constant Frequency Decompositions and Applications (Q3296691) (← links)
• Granular sieving algorithm for selecting best n$$ n $$ parameters (Q6087609) (← links)
• Collaborative granular sieving: a deterministic multievolutionary algorithm for multimodal optimization problems (Q6125212) (← links)
• Sparse representations of random signals (Q6141480) (← links)
• <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 (Q6149839) (← links)
• Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes (Q6185418) (← links)
• A novel image encryption scheme with adaptive Fourier decomposition (Q6202484) (← links)