Pages that link to "Item:Q753467"
From MaRDI portal
The following pages link to A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures (Q753467):
Displaying 14 items.
- Parametric versions of the fast Fourier transform (Q542231) (← links)
- Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
- Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform (Q709791) (← links)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
- A tensor product formulation of Strassen's matrix multiplication algorithm (Q918132) (← links)
- Multilinear algebra and parallel programming (Q1186818) (← links)
- The ubiquitous Kronecker product (Q1591176) (← links)
- New Good's type Kronecker power expansions (Q2314156) (← links)
- A report on the performance of an implementation of Strassen's algorithm (Q2639595) (← links)
- On the properties of a new tensor product of matrices (Q2940461) (← links)
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures (Q4034618) (← links)
- FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2 (Q5203651) (← links)
- A methodology towards automatic implementation of \(N\)-body algorithms (Q5957860) (← links)
- Generalization of the fast Fourier transform with a constant structure (Q6077988) (← links)
