Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform

DOI10.1016/J.CPC.2005.02.004zbMATH Open1196.65211OpenAlexW2033040025MaRDI QIDQ709791FDOQ709791

Authors: James E. Raynolds, Lenore R. Mullin 

Publication date: 18 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2005.02.004

Recommendations

• A fast conformal mapping algorithm with no FFT
• scientific article; zbMATH DE number 848791
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• The techniques of the generalized fast Fourier transform algorithm
• Parallel FFT algorithms for mimd computers

zbMATH Keywords

optimization\(\psi \)-calculusconformal computingfast Fourier transform (FFT)

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• A method of syntax specification
• Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
• Title not available (Why is that?)
• Four easy ways to a faster FFT
• An APL Compiler for a Vector Processor
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Against the long-range spectral leakage of the cosine window family
• Combining the Hanning windowed interpolated FFT in both directions
• Eliminating the picket fence effect of the fast Fourier transform

Uses Software

• APL

This page was built for publication: Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709791)