\documentclass[11pt,letterpaper]{article}

\usepackage{fullpage}
\usepackage{amsmath}
\newcommand{\uu}{\mathbf{u}}
\newcommand{\uuh}{\hat{\uu}}
\newcommand{\MM}{\mathbf{M}}
\newcommand{\vv}{\mathbf{v}}
\newcommand{\dvv}{\Delta\vv}
\newcommand{\vvh}{\hat{\vv}}
\newcommand{\dvvh}{\hat{\Delta\vv}}
\newcommand{\xx}{\mathbf{x}}
\newcommand{\dxx}{\Delta\xx}
\newcommand{\xxh}{\hat{\xx}}
\newcommand{\dxxh}{\hat{\Delta\xx}}
\newcommand{\FF}{\mathbf{F}}
\newcommand{\FFh}{\hat{\FF}}
\renewcommand{\AA}{\mathbf{A}}
\newcommand{\bb}{\mathbf{b}}
\newcommand{\z}{\mathbf{0}}
\newcommand{\gp}[1]{{\left({#1}\right)}}
\newcommand{\mx}[1]{\gp{\begin{array}{c} #1 \end{array}}}
\newcommand{\dd}[2]{\frac{d{#1}}{d{#2}}}

\begin{document}

\title{CS 205b / CME 306}
\author{Application Track}
\date{Homework 3}
\maketitle

\begin{enumerate}
\item Consider a 1D discretization with $\Delta x = \frac{1}{3}$ and the nine grid values $\rho_0 = 2$, $\rho_1 = 5$, $\rho_2 = 3$, $\rho_3 = 1$, $\rho_4 = -2$, $\rho_5 = -1$, $\rho_6 =
  0$, $\rho_7 = 0$, $\rho_8 = 0$.  Let the locations of these grid values be $x_0 = 0$, $x_1 = \Delta x$, $x_2 = 2 \Delta x$, etc.
  \begin{enumerate}
  \item Construct the divided difference table for the data.  Note that you will need to use $\Delta x$ to construct this table.  The first level of the table should consist of the ten
    values given above, and there should be three additional levels above it.  Thus, your table should consist of $9 + 8 + 7 + 6$ entries.
  \item Assume information is flowing to the right ($u > 0$).  For each of the positions $x_3$, $x_4$, and $x_5$, use third order HJ ENO to compute a Newton polynomial at that position.
  Call these polynomials $P_3^r(x)$, $P_4^r(x)$, and $P_5^r(x)$.  You should leave your polynomials in the form of a Newton polynomial.
  \item These polynomials are constructed to be interpolating polynomials.  Show that $P_4^r(x)$ is in fact an interpolating polynomial.
  \item Assume instead that information is flowing to the left ($u < 0$).  Use third order HJ ENO to compute the polynomials $P_3^l(x)$, $P_4^l(x)$, and $P_5^l(x)$.  You should leave
  your polynomials in the form of a Newton polynomial.
  \item Above you computed six Newton polynomials.  They should all look distinct, but they are not all distinct polynomials.  Which polynomials are actually equal and why?  You should
  not expand out the polynomals to answer this question.
  \end{enumerate}
\item There are multiple second order Runge Kutta schemes that one might use to evolve $x' = f(x)$.  The classical one (and the one I am referring to when I write RK2) is $x^{n+1/2} =
  x^n + \frac{1}{2} \Delta t f(x^n)$, $x^{n+1} = x^n + \Delta t f(x^{n+1/2})$.  Another second order Runge Kutta method is is TVD RK2, which has the form $\hat{x}^{n+1} = x^n + \Delta t
  f(x^n)$, $x^{n+2} = \hat{x}^{n+1} + \Delta t f(\hat{x}^{n+1})$, $x^{n+1} = \frac{1}{2}(x^n + x^{n+2})$.
  \begin{enumerate}
  \item Show that these two schemes are in fact distinct schemes.
  \item In homework 2, question 3b, you expressed the update rule for a time integration scheme applied to $x' = \lambda x$ (complex $\lambda$) in the form $x^{n+1} = C x^n$, where $C$
    is a complex number that depends only only the value of $\lambda \Delta t$.  Compute the expression for $C$ for both of these schemes.  Let $C_2$ be the one you computed for RK2.
  \item Use this to argue that the two schemes have identical stability plots.  You do not need to construct the stability plots.
  \item Let $C_1$ be the expression for $C$ that is obtained for forward Euler, $C_3$ the expression obtained for TVD RK3, and $C_4$ the value obtained for RK4.  It is okay to read off
  $C_1$ from the answer key to the assignment where you computed this, but you will need to derive $C_3$ and $C_4$.
  \item We could continue in this way using an explicit $n$-order scheme to derive $C_n$.  What is $C_\infty$ and why?
  \item What does the stability region for $C_\infty$ look like?  You should work out the stability region analytically.  You do not need to generate a stability plot for it.
  \end{enumerate}
\end{enumerate}

\end{document}

