next up previous
Next: About this document ...


\includegraphics[width=1.5cm]{crest97bw.eps}
University of the Witwatersrand
Advanced Techniques in Physics : Part 2 - 2004
Tutorial 2 : 55 Marks
Numerical methods


  1. In the context of discretising partial differential equations :
    1. Give the difference formula for the Laplacian. (5)

    2. Using the Taylor Expansion, evaluate the error of the approximation explicitly to the next order. (5)

    3. Suppose $\phi_1$ and $\phi_2$ are two solutions with the mesh size $h$ and $h/j$ respectively. Derive the Richardson extrapolation formula which shows that an improved solution is

      \begin{displaymath}
\phi_3 = (j^2\phi_2 - \phi_1)/(j^2-1)
\end{displaymath}


      (Hint : $\phi_h = \phi + h^2f + O(h^4)$.) (5)

    [15]

  2. In the context of investigating the stability of numerical solutions :
    1. Write down the explicit discretised version of the Schrödinger equation directly from the differential equation. (3)

    2. Use Von Neumann stability analysis (based on the local solution $\psi^n_j = \xi^n e^{-kj\Delta x}$) to show

      \begin{displaymath}
\xi = 1 - i \left[ \frac{4\Delta t}{(\Delta x)^2}
\sin^2\left(\frac{k\Delta x}{2}\right) +V_j\Delta t \right]
\end{displaymath}

      (3)

    3. Show that $\vert\xi\vert>1$ and that this approach is unstable. (3)

    4. Show that the the explicit discretised version of the Schrödinger equation corresponds to finite difference approximation to the formal solution which is first order in time,

      \begin{displaymath}
\psi^{n+1}_j = (1-iH\Delta t)\psi^n_j.
\end{displaymath}

      (3)

    5. Show that the operator is not unitary. (3)

    6. An implicit scheme resulting from the discretised version of the Schrödinger equation (after some re-arrangement) is by contrast

      \begin{displaymath}
\psi^{n+1}_j = (1+iH\Delta t)^{-1}\psi^n_j
\end{displaymath}

      which is also first order accurate in time and not unitary. Use Von Neumann stability analysis again to show that

      \begin{displaymath}
\xi = \frac{1}{1+i\left[ \frac{4\Delta t}{(\Delta x)^2}
\sin^2\left(\frac{k\Delta x}{2}\right) +V_j\Delta t \right]}
\end{displaymath}

      and that this is now unconditionally stable. (3)

    7. Cayley's approximation for the finite difference of $e^{-iHt}$

      \begin{displaymath}
e^{-iHt} = \frac{(1-\mbox{$\frac{1}{2}$}iH\Delta t)}{(1+\mbox{$\frac{1}{2}$}iH\Delta t)}
\end{displaymath}

      leads to a finite difference scheme which is stable, unitary and second order accurate in both space and time. Suggest why it would become second order accurate. (2)

    [20]

  3. In the context of curve fitting :
    Suppose both the dependent variables $(x_i, y_i)$ in a two dimensional curve had errors (normally distributed) $\sigma^2_{x_i}$, $\sigma^2_{y_i}$. Derive a first order approximation to the variance $\sigma^2_u$ of the function $u=f(x,y)$. [10]

  4. In the context of Monte Carlo Methods :
    A sequence of random events has a constant average rate $\mu$, an exponential waiting time distribution for the time between each event and a Poisson frequency distribution for the number $n$ of events in time $T$. The equation

    \begin{displaymath}
\overline n = \mu \tau
\end{displaymath}

    links the two distributions, as $\overline n$ is the average of the Poisson frequency distribution for the number of events $n$ in time $T$ and $\tau$ characterises the mean life time of the exponential waiting time distribution. This can be exploited to derive a sampling method for Poisson Deviates $n$ using

    \begin{displaymath}
\Sigma_{i=1}^{k_{min}} t_i > T
\end{displaymath}

    and then setting $n=k_{min}-1$ where the $t_i$ are exponential deviates. Demonstrate this. [10]




next up previous
Next: About this document ...
Connell 2004-06-16