next up previous contents
Next: Computational Grid Up: NUMERICAL METHODS FOR THE Previous: Higher-Order Finite Difference Methods   Contents

``FAST'' POISSON SOLVER

These are fast, in the sense that if you use an FFT to do the Fourier computations, it is faster that the Discrete Fourier Transform (DFT). Competitive in speed with ADI and SOR optimized. It proves useful, in any event, to know how to use this technology because its applicable to other boundary value problems.

Motivations There are a number of reasons for visiting this problem:

We will solve the Helmholtz Equation

(172) $\displaystyle \big(\nabla^2+\kappa^2\big)U=g \left\{ \begin{array}{l} g, \qquad...
...ox {real} k, \qquad \mbox {real} u, \qquad \mbox {real} \end{array} \right.$

on a unit disk with domain $\displaystyle D=\left\{(x,y)\in R^2:x^2+y^2<1\right\}$

with boundary conditions $ \left\{\begin{array}{ll}
U(\cos \theta, \sin \theta)=\phi (\theta) & 0\le \the...
...)=\phi (2\pi)\quad ,& \mbox {Dirichlet
boundary conditions}
\end{array}\right.$

Remarks Note that (173), with $k^2=0$, we get the Poisson Equation. The Helmholtz Equation originates from the linear 2-way wave equation, where the time dependence of the solution is assured time harmonic:

To see this, take the Wave Equation (with no forcing term, for simplicity)

(173) $\displaystyle \frac{1}{c^2}\psi_{tt}-\nabla^2 \psi=0\quad c^2>0$$\displaystyle \mbox { constant,}$

where $c$ is the wave speed.

Substitute

(174) $\displaystyle U(x,y)= \psi e^{-i\omega t}$

where $\omega$ is the frequency of the wave, assumed constant. Let $\displaystyle \frac{\omega}{c} = \kappa$ be the wavenumber, then the (175) solution to (174) is found by solving

(175) $\displaystyle (\kappa^2+\nabla^2)U=0$

When the problem is defined on a disk and a forcing term $g$ is added to the equation (176), we get (173).


next up previous contents
Next: Computational Grid Up: NUMERICAL METHODS FOR THE Previous: Higher-Order Finite Difference Methods   Contents
Juan Restrepo 2003-05-02