Two dimensional fast Fourier transform for large data matrices (Q1330618): Difference between revisions
From MaRDI portal
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/0010-4655(89)90108-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979902161 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A stepwise approach to computing the multidimensional fast Fourier transform of large arrays / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4154030 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast Computer Method for Matrix Transposing / rank | |||
Normal rank | |||
Latest revision as of 16:00, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two dimensional fast Fourier transform for large data matrices |
scientific article |
Statements
Two dimensional fast Fourier transform for large data matrices (English)
0 references
30 October 1994
0 references
fast Fourier transform
0 references
Fortran program
0 references
large data matrices
0 references
Cooley- Tukey algorithm
0 references
0 references
