## An introduction to fast fourier transform methods for partial differential equations, with applications |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Basic Preliminaries | 1 |

Algorithms | 23 |

FFT Solution of Partial Differential Equations | 49 |

Copyright | |

7 other sections not shown

### Other editions - View all

### Common terms and phrases

5-point applied approximation assume Buzbee calculation capacitance capacity matrix Chapter coefficient complex components compute Concus conjugate corresponding cyclic reduction defined denotes derived described difference equations Dirichlet boundary conditions Dirichlet conditions Dirichlet problem discrete Poisson equation discussion efficient eigenvalues eigenvectors eliminated equations elliptic problems evaluation example exponential scheme factor Fast Fourier Transform fast solvers FFT algorithm FFT methods FFT techniques finite finite-difference formula Fortran Fourier analysis Fourier harmonics Fourier series Furthermore given grid points Hence Hockney Hockney's Huntley indicated iteration Laplace transform linear equations matrix factorisation matrix of order maximum modulus error mesh multiplications numerical solution obtain operation count overall parabolic partial differential equations Phys Pickering Poisson problem Poisson's equation Proskurowski rectangle rectangular region reduction procedure relation relevant respectively right-hand side Section solution of Poisson's subsidiary equation suitable systems of equations tridiagonal matrix tridiagonal systems usual values vectors Widlund written