Two‐dimensional adaptive Fourier decomposition

DOI10.1002/mma.3649zbMath1347.42047arXiv1406.2088OpenAlexW2963385417MaRDI QIDQ5739228

Tao Qian

Publication date: 15 July 2016

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2088

zbMATH Keywords

greedy algorithmmultiple Fourier seriesTakenaka-Malmquist systemsignal analysisrational orthogonal systemsystems identificationadaptive Fourier decompositioncomplex Hardy spaceinduced complete dictionaryproduct-Szegő dictionaryproduct-TM system

Mathematics Subject Classification ID

Banach algebras of differentiable or analytic functions, (H^p)-spaces (46J15) (H^p)-spaces (42B30) Harmonic analysis in several variables (42B99) (H^p)-spaces, Nevanlinna spaces of functions in several complex variables (32A35) Fourier series and coefficients in several variables (42B05) Conjugate functions, conjugate series, singular integrals (42A50) Numerical methods in Fourier analysis (65T99)

Related Items (24)

FFT formulations of adaptive Fourier decomposition ⋮ Weak pre-orthogonal adaptive Fourier decomposition in Bergman spaces of pseudoconvex domains ⋮ A class of iterative greedy algorithms related to Blaschke product ⋮ Positive-instantaneous frequency and approximation ⋮ Sparse representation of approximation to identity ⋮ \(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 ⋮ Adaptive Fourier decomposition of slice regular functions ⋮ Adaptative decomposition: the case of the Drury-Arveson space ⋮ Unconditional basis constructed from parameterised Szegö kernels in analytic \(\mathbb{H}^p(D)\) ⋮ 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 ⋮ Adaptive orthonormal systems for matrix-valued functions ⋮ Reproducing kernel representation of the solution of second order linear three‐point boundary value problem ⋮ The sparse representation related with fractional heat equations ⋮ A Theory on Non-Constant Frequency Decompositions and Applications ⋮ 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 ⋮ Rational approximation in Hardy spaces on strips ⋮ Rational approximation in a class of weighted Hardy spaces ⋮ Adaptive decompositions in monogenic reproducing kernel Hilbert spaces of Paley-Wiener type

Cites Work

• Unnamed Item
• Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system
• A fast adaptive model reduction method based on Takenaka-Malmquist systems
• On backward shift algorithm for estimating poles of systems
• Orthonormal bases with nonlinear phases
• The Bedrosian identity and homogeneous semi-convolution equations
• Greedy algorithm and \(m\)-term trigonometric approximation
• Clifford algebras, Fourier transforms and singular convolution operators on Lipschitz surfaces
• The Paley-Wiener theorem in \(\mathbb{R}^n\) with the Clifford analysis setting
• Some remarks on greedy algorithms
• Rational orthogonal bases satisfying the Bedrosian identity
• Weak greedy algorithms
• Adaptive Fourier series---a variation of greedy algorithm
• Analysis of the intrinsic mode functions
• Matching pursuits among shifted Cauchy kernels in higher-dimensional spaces
• Adaptive Fourier decomposition of functions in quaternionic Hardy spaces
• Intrinsic mono-component decomposition of functions: An advance of Fourier theory
• Matching pursuits with time-frequency dictionaries
• Optimal approximation by Blaschke forms
• REMARKS ON ADAPTIVE FOURIER DECOMPOSITION
• Rational orthogonal systems are Schauder bases
• Adaptive greedy approximations

This page was built for publication: Two‐dimensional adaptive Fourier decomposition