Adaptive Fourier series---a variation of greedy algorithm

DOI10.1007/s10444-010-9153-4zbMath1214.30047OpenAlexW2086494340MaRDI 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

Hardy spaces (30H10) Blaschke products (30J10)

Related Items (77)

FFT formulations of adaptive Fourier decomposition ⋮ A frame theory of Hardy spaces with the quaternionic and the Clifford algebra settings ⋮ Weak pre-orthogonal adaptive Fourier decomposition in Bergman spaces of pseudoconvex domains ⋮ A class of iterative greedy algorithms related to Blaschke product ⋮ The Fourier type expansions on tubes ⋮ Fast analytic sampling approximation from Cauchy kernel ⋮ New aspects of Beurling-Lax shift invariant subspaces ⋮ Rational approximation of functions in Hardy spaces ⋮ Positive-instantaneous frequency and approximation ⋮ 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 ⋮ Adaptive Fourier tester for statistical estimation ⋮ Analytic phase retrieval based on intensity measurements ⋮ Consecutive minimum phase expansion of physically realizable signals with applications ⋮ Characterizations of mono-components: the Blaschke and starlike types ⋮ Wavelets and holomorphic functions ⋮ Phase derivative of monogenic signals in higher dimensional spaces ⋮ Some remarks on the boundary behaviors of functions in the monogenic Hardy spaces ⋮ System identification by discrete rational atoms ⋮ The adaptive Fourier decomposition for financial time series ⋮ \(n\)-best kernel approximation in reproducing kernel Hilbert spaces ⋮ Algorithm of adaptive Fourier decomposition in H2(ℂ+) ⋮ Nonlinear expansions in reproducing kernel Hilbert spaces ⋮ Phase unwinding, or invariant subspace decompositions of Hardy spaces ⋮ Orthogonalization in Clifford Hilbert modules and applications ⋮ A sparse kernel approximate method for fractional boundary value problems ⋮ Adaptive Fourier decomposition of slice regular functions ⋮ Weighted singular value decomposition basis of Szegő kernel and its applications to signal reconstruction and denoising ⋮ Adaptative decomposition: the case of the Drury-Arveson space ⋮ Unconditional basis constructed from parameterised Szegö kernels in analytic \(\mathbb{H}^p(D)\) ⋮ Robust multiscale analytic sampling approximation to periodic function and fast algorithm ⋮ 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 ⋮ Hardy-Hodge decomposition of vector fields in ℝⁿ ⋮ Matching pursuit with unbounded parameter domains ⋮ Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes ⋮ Adaptive orthonormal systems for matrix-valued functions ⋮ Reproducing kernel representation of the solution of second order linear three‐point boundary value problem ⋮ A fast adaptive model reduction method based on Takenaka-Malmquist systems ⋮ Hardy space decompositions of L^p(ℝⁿ) for 0 < p < 1 with rational approximation ⋮ Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space ⋮ A Theory on Non-Constant Frequency Decompositions and Applications ⋮ An application of entire function theory to analytic signals ⋮ Constructions of \(\epsilon\)-mono-components and mathematical analysis on signal decomposition algorithm ⋮ Greedy Algorithms and Rational Approximation in One and Several Variables ⋮ Compressed Sensing with Nonlinear Fourier Atoms ⋮ A stochastic sparse representation: \(n\)-best approximation to random signals and computation ⋮ Adaptive rational approximation in Bergman space on bounded symmetric domain ⋮ Reproducing kernel sparse representations in relation to operator equations ⋮ REMARKS ON ADAPTIVE FOURIER DECOMPOSITION ⋮ Cyclic AFD algorithm for the best rational approximation ⋮ Rational orthogonal systems are Schauder bases ⋮ Computation of adaptive Fourier series by sparse approximation of exponential sums ⋮ Two‐dimensional adaptive Fourier decomposition ⋮ Spectra of rational orthonormal systems ⋮ Mathematical theory of signal analysis vs. complex analysis method of harmonic analysis ⋮ Basis pursuit for frequency-domain identification ⋮ Identification of discrete Hammerstein systems by using adaptive finite rational orthogonal basis functions ⋮ Extracting outer function part from Hardy space function ⋮ Rational approximation in Hardy spaces on strips ⋮ Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients ⋮ An estimate on the Bedrosian commutator in Sobolev space ⋮ Rational approximation in a class of weighted Hardy spaces ⋮ MIMO frequency domain system identification using matrix-valued orthonormal functions ⋮ An enhancement algorithm for cyclic adaptive Fourier decomposition ⋮ Adaptive decompositions in monogenic reproducing kernel Hilbert spaces of Paley-Wiener type ⋮ TRANSIENT TIME-FREQUENCY DISTRIBUTION BASED ON MONO-COMPONENT DECOMPOSITIONS ⋮ Sparse Representation of Signals in Hardy Space ⋮ Adaptive Fourier decomposition of functions in quaternionic Hardy spaces ⋮ Expansions of functions based on rational orthogonal basis with nonnegative instantaneous frequencies ⋮ ANALYTIC SAMPLING APPROXIMATION BY PROJECTION OPERATOR WITH APPLICATION IN DECOMPOSITION OF INSTANTANEOUS FREQUENCY ⋮ Approximation of functions by higher order Szegö kernels I. Complex variable cases ⋮ On the order of rational Fourier coefficients of various bounded variations ⋮ The AFD methods to compute Hilbert transform ⋮ On sparse representation of analytic signal in Hardy space ⋮ A novel feature representation approach for single-lead heartbeat classification based on adaptive Fourier decomposition ⋮ Multi-scale analysis of influencing factors for soybean futures price risk: Adaptive Fourier decomposition mathematical model applied for the case of China

Cites Work

This page was built for publication: Adaptive Fourier series---a variation of greedy algorithm