Adaptive Fourier series---a variation of greedy algorithm

DOI10.1007/s10444-010-9153-4zbMath1214.30047MaRDI QIDQ2431113

Publication date: 8 April 2011

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-010-9153-4

zbMATH Keywords

Hardy space; greedy algorithm; Blaschke product; instantaneous frequency; rational orthonormal system

Mathematics Subject Classification ID

30H10: Hardy spaces

30J10: Blaschke products

Related Items

Hardy-Hodge decomposition of vector fields in ℝⁿ, Hardy space decompositions of L^p(ℝⁿ) for 0 < p < 1 with rational approximation, Greedy Algorithms and Rational Approximation in One and Several Variables, Compressed Sensing with Nonlinear Fourier Atoms, Rational approximation in Hardy spaces on strips, REMARKS ON ADAPTIVE FOURIER DECOMPOSITION, Approximation of functions by higher order Szegö kernels I. Complex variable cases, Cyclic AFD algorithm for the best rational approximation, Rational orthogonal systems are Schauder bases, Two‐dimensional adaptive Fourier decomposition, Fast analytic sampling approximation from Cauchy kernel, New aspects of Beurling-Lax shift invariant subspaces, Phase derivative of monogenic signals in higher dimensional spaces, A fast adaptive model reduction method based on Takenaka-Malmquist systems, Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space, An application of entire function theory to analytic signals, Extracting outer function part from Hardy space function, System identification by discrete rational atoms, Characterizations of mono-components: the Blaschke and starlike types, Wavelets and holomorphic functions, Adaptative decomposition: the case of the Drury-Arveson space, Constructions of \(\epsilon\)-mono-components and mathematical analysis on signal decomposition algorithm, Some remarks on the boundary behaviors of functions in the monogenic Hardy spaces, A stochastic sparse representation: \(n\)-best approximation to random signals and computation, Reproducing kernel sparse representations in relation to operator equations, Computation of adaptive Fourier series by sparse approximation of exponential sums, Spectra of rational orthonormal systems, Mathematical theory of signal analysis vs. complex analysis method of harmonic analysis, Adaptive rational approximation in Bergman space on bounded symmetric domain, Identification of discrete Hammerstein systems by using adaptive finite rational orthogonal basis functions, Rational approximation in a class of weighted Hardy spaces, An enhancement algorithm for cyclic adaptive Fourier decomposition, Expansions of functions based on rational orthogonal basis with nonnegative instantaneous frequencies, The AFD methods to compute Hilbert transform, FFT formulations of adaptive Fourier decomposition, A frame theory of Hardy spaces with the quaternionic and the Clifford algebra settings, Phase unwinding, or invariant subspace decompositions of Hardy spaces, Rational approximation of functions in Hardy spaces, Basis pursuit for frequency-domain identification, TRANSIENT TIME-FREQUENCY DISTRIBUTION BASED ON MONO-COMPONENT DECOMPOSITIONS, Sparse Representation of Signals in Hardy Space, ANALYTIC SAMPLING APPROXIMATION BY PROJECTION OPERATOR WITH APPLICATION IN DECOMPOSITION OF INSTANTANEOUS FREQUENCY, On the order of rational Fourier coefficients of various bounded variations, On sparse representation of analytic signal in Hardy space, Adaptive Fourier decompositions and rational approximations, part I: Theory, Robust multiscale analytic sampling approximation to periodic function and fast algorithm, Adaptive orthonormal systems for matrix-valued functions, Adaptive Fourier decomposition of functions in quaternionic Hardy spaces, Adaptive Fourier tester for statistical estimation, A Theory on Non-Constant Frequency Decompositions and Applications, Signal moments for the short‐time Fourier transform associated with Hardy–Sobolev derivatives, Best two‐parameter rational approximation algorithm of given order: a variation of adaptive Fourier decomposition, Consecutive minimum phase expansion of physically realizable signals with applications

Cites Work