FFT formulations of adaptive Fourier decomposition (Q2360717): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2017.04.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2608355290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Fourier series---a variation of greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two‐dimensional adaptive Fourier decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear phase unwinding of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic mono-component decomposition of functions: An advance of Fourier theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support vector machine adapted Tikhonov regularization method to solve Dirichlet problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical theory of signal analysis vs. complex analysis method of harmonic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system / rank
 
Normal rank
Property / cites work
 
Property / cites work: On backward shift algorithm for estimating poles of systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic Phase Derivatives, All-Pass Filters and Signals of Minimum Phase / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Uncertainty Principle for Linear Canonical Transform in Terms of Phase Derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm of Adaptive Fourier Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: REMARKS ON ADAPTIVE FOURIER DECOMPOSITION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank

Latest revision as of 01:40, 14 July 2024

scientific article
Language Label Description Also known as
English
FFT formulations of adaptive Fourier decomposition
scientific article

    Statements

    FFT formulations of adaptive Fourier decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2017
    0 references
    fast Fourier transform
    0 references
    computational complexity
    0 references
    adaptive decomposition
    0 references
    greedy algorithm
    0 references
    Reproducing kernel Hilbert space
    0 references
    discrete Fourier transform
    0 references
    algorithm
    0 references

    Identifiers