{Numerical Methods for ODEs:} Consider the Linear Multistep Method
\[
y_{n+2}-\frac{4}{3}y_{n+1}+\frac{1}{3}y_n=\frac{2}{3}k f_{n+2}
\]
for solving an initial value problem \(y'=f(y,x)\), \(y(0)=\eta\). You may assume
that \(f\) is Lipschitz continuous with respect to \(y\) uniformly for all \(x\).
**a)** Analyze the consistency, stability, accuracy, and convergence
properties of this method.
**b)** Sketch a graph of the solution to the following initial value
problem.
\[
y'=-10^8[y-\cos(x)]-\sin(x),\qquad y(0)=2.
\]
Would it be more reasonable to use this method or Euler's method for this
problem? What would you consider in choosing a timestep \(k\) for each of the
methods? Justify your answer.
**Fact 1:** A real symmetric \(n\times n\) matrix \(A\) can be diagonalized by an
orthogonal similarity transformation, and \(A\)'s eigenvalues are real.
**Fact 2:** The \((N-1)\times(N-1)\) matrix \(M\) defined by
\[
M=
\begin{bmatrix}
-2 & 1 & 0 & \cdots & 0 & 0\\
1 & -2 & 1 & \ddots & \vdots & \vdots\\
0 & 1 & -2 & \ddots & 0 & 0\\
\vdots & \ddots & \ddots & \ddots & 1 & 0\\
0 & \cdots & 0 & 1 & -2 & 1\\
0 & \cdots & 0 & 0 & 1 & -2
\end{bmatrix}
\]
has eigenvalues
\[
\mu_l=-4\sin^2\left(\frac{\pi l}{2N}\right),
\qquad l=1,2,\ldots,N-1.
\]
**Fact 3:** The \((N+1)\times(N+1)\) matrix:
\[
\begin{bmatrix}
-1 & 1 & 0 & \cdots & 0 & 0\\
1 & -2 & 1 & \ddots & \vdots & \vdots\\
0 & 1 & -2 & \ddots & 0 & 0\\
\vdots & \ddots & \ddots & \ddots & 1 & 0\\
0 & \cdots & 0 & 1 & -2 & 1\\
0 & \cdots & 0 & 0 & 1 & -1
\end{bmatrix}
\]
has eigenvalues
\[
\mu_l=-4\sin^2\left(\frac{\pi l}{2(N+1)}\right),
\qquad l=0,1,\ldots,N.
\]
**Fact 4:** For a real \(n\times n\) matrix \(A\), the Rayleigh quotient of a vector
\(x\in\mathbb{R}^n\) is the scalar
\[
r(x)=\frac{x^T Ax}{x^T x}.
\]
The gradient of \(r(x)\) is
\[
\nabla r(x)=\frac{2}{x^T x}(Ax-r(x)x).
\]
If \(x\) is an eigenvector of \(A\) then \(r(x)\) is the corresponding eigenvalue and
\(\nabla r(x)=0\).
Question
Math 6610 • Analysis of Numerical Methods I
Spring 2010 • Question 7