Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms (Q1103363): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114215322 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90325-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965533562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relationship Between Two Fast Fourier Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4211853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Implementation of Fast Radix 2 Transforms on Array Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Winograd's Fourier transform via circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptation of the Fast Fourier Transform for Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3685231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix identities of the fast Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel calculation of a linear mapping on a computer network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel realization of permutations over trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:27, 18 June 2024

scientific article
Language Label Description Also known as
English
Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
scientific article

    Statements

    Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms (English)
    0 references
    0 references
    1988
    0 references
    A method, called minimal-variable oblique elimination is developed for implementing parallel computation of discrete Fourier transforms on linear, or mesh-connected, arrays of processors. Before explicit describing this factorization, the author discusses necessary and sufficient conditions for its practice and proves then the applicability of this technique to compute discrete Fourier transforms of all orders. Complexity in the computation is also estimated.
    0 references
    0 references
    0 references
    0 references