Most implementations of a radix-2 fast Fourier transform on large scientific computers use algorithms that involve memory accesses whose strides are powers of two. (The term stride means the memory increment between successive elements stored or fetched.) Such strides are unacceptable for recently d
Performance Evaluation of a Multithreaded Fast Fourier Transform Algorithm for Derivative Pricing
β Scribed by Ruppa K. Thulasiram; Parimala Thulasiraman
- Book ID
- 111542369
- Publisher
- Springer US
- Year
- 2003
- Tongue
- English
- Weight
- 577 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0920-8542
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The fast Fourier transform (FFT) is very frequently used in various fields such as computer tomography, speech recognition, and image processing. As the area of computer applications has broadened, the quantity of data to be transformed has greatly increased. A parallel FFT is one way of achieving a
## Abstract Designing proteins with novel protein/protein binding properties can be achieved by combining the tools that have been developed independently for protein docking and protein design. We describe here the sequenceβindependent generation of protein dimer orientations by protein docking fo