Improved upper complexity bounds for the discrete Fourier transform (Q811112): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complexity of group algebra computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the general discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier Transforms for Metabelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast generalized Fourier transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of spectral analysis with application to ranked data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of the Fourier Transform on Finite Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Gruppen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier Transforms on Finite Non-Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier transform and convolution algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier analysis for abelian group extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4728532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the Discrete Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883493 / rank
 
Normal rank

Revision as of 09:20, 24 June 2024

scientific article
Language Label Description Also known as
English
Improved upper complexity bounds for the discrete Fourier transform
scientific article

    Statements

    Improved upper complexity bounds for the discrete Fourier transform (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    By investigating several classical fast Fourier transform algorithms, this paper evaluates the upper bounds \(L_ 2(G)|_{\max}\), such that \(L_ 2(G)|_{\max}\leq 8| G| \log_ 2| G|\) in the discrete Fourier transform on any finite metabelian group G.
    0 references
    group algebra
    0 references
    linear complexity
    0 references
    fast Fourier transform
    0 references
    discrete Fourier transform
    0 references

    Identifiers