Intrinsic mono‐component decomposition of functions: An advance of Fourier theory

By Tao Qian. 2010

133 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Cyclic AFD algorithm for the best rational approximation (2014, methodology): “The expression (12) was first used in [15] and [14], in which AFD and unwending AFD are proposed.”
Optimal approximation by Blaschke forms (2013, methodology): “As a realizable variant of the matching pursuit algorithm [4] greedy n-systems and some related problems of function decomposition are studied in [2,3].”
Two‐dimensional adaptive Fourier decomposition (2014, unknown): “Remark 1 There are variations of 1-D AFD (also called Core AFD in later references as it is the construction block of the other AFDs based on maximal selections) of which we mention unwinding AFD [16], cyclic AFD [17], and higher-order-Szegö-kernel AFD [18].”
Nonlinear Phase Unwinding of Functions (2015, background): “Of particular importance is a paper of Tao Qian [18] in which he proves the convergence of the unwinding series for F ∈ H(2)(T).”
Adaptive Fourier decomposition of functions in quaternionic Hardy spaces (2012, methodology): “In [5], the author investigated intrinsic mono-component decomposition of functions in the Hardy space H2.”