Two-dimensional adaptive Fourier decomposition
From MaRDI portal
adaptive Fourier decompositioncomplex Hardy spacegreedy algorithminduced complete dictionarymultiple Fourier seriesproduct-Szegő dictionaryproduct-TM systemrational orthogonal systemsignal analysissystems identificationTakenaka-Malmquist system
(H^p)-spaces, Nevanlinna spaces of functions in several complex variables (32A35) Conjugate functions, conjugate series, singular integrals (42A50) Fourier series and coefficients in several variables (42B05) (H^p)-spaces (42B30) Harmonic analysis in several variables (42B99) Banach algebras of differentiable or analytic functions, (H^p)-spaces (46J15) Numerical methods in Fourier analysis (65T99)
Abstract: One-dimensional adaptive Fourier decomposition, abbreviated as 1-D AFD, or AFD, is an adaptive representation of a physically realizable signal into a linear combination of parameterized Szeg"o and higher order Szeg"o kernels of the context. In the present paper we study multi-dimensional AFDs based on multivariate complex Hardy spaces theory. We proceed with two approaches of which one uses Product-TM Systems; and the other uses Product-Szeg"o Dictionaries. With the Product-TM Systems approach we prove that at each selection of a pair of parameters the maximal energy may be attained, and, accordingly, we prove the convergence. With the Product-Szeg"o dictionary approach we show that Pure Greedy Algorithm is applicable. We next introduce a new type of greedy algorithm, called Pre-Orthogonal Greedy Algorithm (P-OGA). We prove its convergence and convergence rate estimation, allowing a weak type version of P-OGA as well. The convergence rate estimation of the proposed P-OGA evidences its advantage over Orthogonal Greedy Algorithm (OGA). In the last part we analyze P-OGA in depth and introduce the concept P-OGA-Induced Complete Dictionary, abbreviated as Complete Dictionary . We show that with the Complete Dictionary P-OGA is applicable to the Hardy space on -torus.
Recommendations
Cites work
- A fast adaptive model reduction method based on Takenaka-Malmquist systems
- Adaptive Fourier decomposition of functions in quaternionic Hardy spaces
- Adaptive Fourier series---a variation of greedy algorithm
- Adaptive greedy approximations
- Analysis of the intrinsic mode functions
- Clifford algebras, Fourier transforms and singular convolution operators on Lipschitz surfaces
- Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system
- Greedy algorithm and \(m\)-term trigonometric approximation
- scientific article; zbMATH DE number 3367521 (Why is no real title available?)
- Intrinsic mono-component decomposition of functions: an advance of Fourier theory
- Matching pursuits among shifted Cauchy kernels in higher-dimensional spaces
- Matching pursuits with time-frequency dictionaries
- On backward shift algorithm for estimating poles of systems
- Optimal approximation by Blaschke forms
- Orthonormal bases with nonlinear phases
- Rational orthogonal bases satisfying the Bedrosian identity
- Rational orthogonal systems are Schauder bases
- REMARKS ON ADAPTIVE FOURIER DECOMPOSITION
- Some remarks on greedy algorithms
- The Bedrosian identity and homogeneous semi-convolution equations
- The Paley-Wiener theorem in \(\mathbb{R}^n\) with the Clifford analysis setting
- Weak greedy algorithms
Cited in
(41)- Adaptative decomposition: the case of the Drury-Arveson space
- A stochastic sparse representation: n-best approximation to random signals and computation
- Reproducing kernel sparse representations in relation to operator equations
- Adaptive decompositions in monogenic reproducing kernel Hilbert spaces of Paley-Wiener type
- Positive-instantaneous frequency and approximation
- Adaptive rational approximation in Bergman space on bounded symmetric domain
- Rational approximation in a class of weighted Hardy spaces
- FFT formulations of adaptive Fourier decomposition
- Adaptive Fourier decomposition of slice regular functions
- Adaptive orthonormal systems for matrix-valued functions
- A theory on non-constant frequency decompositions and applications
- Rational approximation in Hardy spaces on strips
- REMARKS ON ADAPTIVE FOURIER DECOMPOSITION
- Sparse representation of approximation to identity
- Weak pre-orthogonal adaptive Fourier decomposition in Bergman spaces of pseudoconvex domains
- \(n\)-best kernel approximation in reproducing kernel Hilbert spaces
- Orthogonalization in Clifford Hilbert modules and applications
- A sparse kernel approximate method for fractional boundary value problems
- Unconditional basis constructed from parameterised Szegö kernels in analytic \(\mathbb{H}^p(D)\)
- Frequency analysis with multiple kernels and complete dictionary
- Sparse representations of random signals
- Matching pursuit with unbounded parameter domains
- Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes
- Reproducing kernel representation of the solution of second order linear three‐point boundary value problem
- The sparse representation related with fractional heat equations
- Adaptive Fourier decompositions and rational approximations. I: Theory
- Rate of convergence for double rational Fourier series
- Kernel approximation for weighted Bergman spaces on tube domains
- A sparse approximation for fractional Fourier transform
- Sparse series solutions of random boundary and initial value problems
- Trends by adaptive Fourier decomposition and application in prediction
- Weak \(N\)-best POAFD for solving parabolic equations in reproducing kernel Hilbert space
- Harmonic and heat flow representations of the Gaussian white noise
- Adaptive decomposition for matrix-valued functions on polydiscs
- A direct proof for the existence of best approximation of random signals
- A necessary and sufficient condition for a TM system to be an unconditional basis
- N-best adaptive Fourier decomposition for slice hyperholomorphic functions
- Sparse representation of random field via probability chaos
- Sparse representations of approximation to identity via time–space fractional heat equations
- Complete dictionary type stochastic sparse representation and its applications in random process simulation
- A class of iterative greedy algorithms related to Blaschke product
This page was built for publication: Two-dimensional adaptive Fourier decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739228)
