HTML version of Abstract of Basic Foils prepared April 22 2000

Abstract of Parallel FFT and use in PDE Solvers

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox *
1 We start by motivating the FFT (Fast Fourier Transform) as a solver for Poisson's equation
2 The we discuss sequential 1D discrete FFT in both DIF (Decimation in Frequency) and DIT (Decimation in Time) modes
3 We describe general N=N1*N2 case but soon specialize to binary (Cooley Tukey) FFT.
4 For binary case, we go through parallelism and use of cache giving a performance analysis
5 These lectures motivate later lectures on Fast Multipole method as general Green's function solver which is more flexible than FFT
in Table To:

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Mon Apr 24 2000