Is computing with the finite Fourier transform pure or applied mathematics? (Q3931844): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translation-invariant subspaces in L\(^2\) of a compact nilmanifold. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian harmonic analysis, theta functions and function algebras on a nilmanifold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Structures for � Σ n 1 L 2 (Z/n) Compatible with the Finite Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3278470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5521595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic Analysis on Nilmanifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic analysis on compact solvmanifolds / 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: Analogues of Poisson's Summation Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5831393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5612629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5730968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplicity problem for 4-dimensional solvmanifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur certains groupes d'opérateurs unitaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the Discrete Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of multiplications necessary to compute certain functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bilinear forms whose multiplicative complexity depends on the field of constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiplicative complexity of the discrete Fourier transform / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0273-0979-1979-14686-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069384709 / rank
 
Normal rank

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Is computing with the finite Fourier transform pure or applied mathematics?
scientific article

    Statements

    Is computing with the finite Fourier transform pure or applied mathematics? (English)
    0 references
    0 references
    0 references
    1979
    0 references
    Fourier-Stieltjes transforms
    0 references
    eigenvalues
    0 references
    Plancherel theorem
    0 references
    algebraic complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references