# Numerical Analysis/stability of Multistep methods

For multistep methods, the problems involved with consistence, convergence and stability are complicated because of the number of approximations involved at each step. In the one step method, the approximation ${\displaystyle w_{i+1}}$ depends only on the previous approximation ${\displaystyle w_{i}}$, whereas the multistep methods use at least two of the previous approximations, and the usual method that are employed involve more.

# Stable Multistep Method

## Characteristic polynominals

For the multistep method:

${\displaystyle w_{0}=\alpha ,w_{1}=\alpha _{1},...,w_{m-1}=\alpha _{m-1}}$,
${\displaystyle w_{i+1}=a_{m-1}w_{i}+a_{m-2}w_{i-1}+...+a_{0}w_{i+1-m}+hF(t_{i},h,w_{i+1},w_{i},...,w_{i+1-m})}$,

the polynominal

${\displaystyle P(\lambda )=\lambda ^{m}-a_{m-1}\lambda ^{m-1}-a_{m-2}\lambda ^{m-2}-...a_{1}\lambda -a_{0}}$ ,

is called the characteristic polynominal of the above mutistep method.

The stability of a multistep method with respect to round-off error is dictated by the magnitudes of the zeros of the characteristic polynominal.

## Root condition

Let ${\displaystyle \lambda _{1},\lambda _{2},...,\lambda _{m},}$ denote the (not necessarily distinct) roots of the characteristic equation

${\displaystyle P(\lambda )=\lambda ^{m}-a_{m-1}\lambda ^{m-1}-a_{m-2}\lambda ^{m-2}-...a_{1}\lambda -a_{0}=0}$ ,

associated with the multistep difference method

${\displaystyle w_{0}=\alpha _{0},w_{1}=\alpha _{1},...,w_{m-1}=\alpha _{m-1}}$,
${\displaystyle w_{i+1}=a_{m-1}w_{i}+a_{m-2}w_{i-1}+...+a_{0}w_{i+1-m}+hF(t_{i},h,w_{i+1},w_{i},...,w_{i+1-m})\,.}$

If the absolute value ${\displaystyle |\lambda _{i}|\leq 1}$, for each i=1,2,...,m, and all roots with abosolute value 1 are the simple roots, then the difference method is said to satisfy the root condition.

## Stability Definitions

1. Methods that satisfy the root condition and have ${\displaystyle \lambda =1}$ as the only root of the characteristic equation of the magnitude one are called strongly stable.
2. Methods that satisfy the root condition and have more than one distinct root with magnitude one are called weakly stable.
3. Methods that do not satisfy the root condition are called unstable.

## Stable Multistep methods

A multistep method of the form

${\displaystyle w_{0}=\alpha _{0},w_{1}=\alpha _{1},...,w_{m-1}=\alpha _{m-1}}$,
${\displaystyle w_{i+1}=a_{m-1}w_{i}+a_{m-2}w_{i-1}+...+a_{0}w_{i+1-m}+hF(t_{i},h,w_{i+1},w_{i},...,w_{i+1-m})}$,

is stable if and only if it satisfies the root condition. Moreover, if the difference method is consistent with the differential equation, then the method is stable if and only if it is convergent.

## Examples

### Example1

The fourth-order Adams-Bashfoth method is

${\displaystyle w_{i+1}=w_{i}+(h/24)(55f_{i}-59f_{i-1}+37f_{i-2}-9f_{i-3}),}$

where ${\displaystyle f_{i}=f(t_{i},w_{i})\,.}$ The characteristic equation is

${\displaystyle \lambda ^{4}-\lambda ^{3}=\lambda ^{3}(\lambda -1)=0}$

so we find the characteristic roots to be

${\displaystyle \lambda _{1}=1,\quad \lambda _{2}=0,\quad \lambda _{3}=0,\quad {\text{and}}\quad \lambda _{4}=0\,.}$

Thus the 4th-order Adams Method satisfies the root condition and is strongly stable.

### Example 2

Milne's Method is

${\displaystyle w_{i+1}=w_{i-3}+(4h/3)(2f_{i}-f_{i-1}+2f_{i-2}),}$

where ${\displaystyle f_{i}=f(t_{i},w_{i})\,.}$ The characteristic equation is

${\displaystyle \lambda ^{4}-1=0}$

so the characteristic roots are ${\displaystyle \lambda _{1}=1,\quad \lambda _{2}=-1,\quad \lambda _{3}=i,\quad {\text{and}}\quad \lambda _{4}=-i.}$

Thus the 4th-order Milne's Method satisfies the root condition, but it is only weakly stable.

# Absolute Stability & Region of Absolute stability

## Definition

Apply a numerical method to initial-value problem

${\displaystyle y'=\lambda y}$
${\displaystyle y(0)=\alpha \quad {\text{where}}\quad {\text{Re}}(\lambda )<0\,.}$

Suppose that a round off error ${\displaystyle \xi _{0}}$ is introduced in the initial condition for this method. At the nth step the round off error is ${\displaystyle \xi _{n}}$. Provided the step size h is chosen to satisfy ${\displaystyle |\xi _{n}|<|\xi _{0}|}$, the numerical method is said to be absolutely stable for the step size h. And ${\displaystyle R=}$${\displaystyle \{h\lambda \in \mathbb {C} ||\xi _{n}|<|\xi _{0}|\}}$ is said to be region of absolute stability for numerical method.

## Region of absolute stability for one-step method

In general, when a one-step method is applied to the test equation, a function ${\displaystyle Q}$ exists with the property that the difference method gives

${\displaystyle w_{i+1}=Q(h}$${\displaystyle \lambda )w_{i}}$.

The initial round-off error ${\displaystyle \xi _{0}}$ and the round-off error at the ith step ${\displaystyle \xi _{i}}$ will satisfy ${\displaystyle \xi _{i+1}=Q(h}$${\displaystyle \lambda )\xi _{i}}$ which is ${\displaystyle \xi _{i+1}=Q^{i}(h\lambda )\xi _{0}}$.

The inequality ${\displaystyle |\xi _{i}|<|\xi _{0}|}$ will hold if ${\displaystyle |Q(h\lambda )|<1}$. Thus, region R of absolute stability for a one-step method is

${\displaystyle R=}$${\displaystyle \{h\lambda \in \mathbb {C} ||Q(h}$${\displaystyle \lambda )|<1\}\,.}$

## Region of absolute stability for multistep methods

Consider the k-step method

${\displaystyle w_{n+1}=\sum _{j=1}^{k}a_{k-j}w_{n+1-j}+h\sum _{j=0}^{k}b_{k-j}f_{n-j+1}}$
${\displaystyle f_{n-j+1}=f(t_{n-j+1},w_{n-j+1})\,.}$

Applying it to

${\displaystyle y'=\lambda y}$

we get

${\displaystyle w_{n+1}=\sum _{j=1}^{k}a_{k-j}w_{n+1-j}+\lambda h\sum _{j=0}^{k}b_{k-j}w_{n-j+1}}$
${\displaystyle \Leftrightarrow (1-\lambda hb_{k})w_{n+1}-\sum _{j=1}^{k}(a_{k-j}-\lambda hb_{k-j})w_{n+1-j}=0\,.}$

The characteristic polynominal of the method is

${\displaystyle Q(z,h\lambda )=(1-}$${\displaystyle \lambda hb_{k})z^{k}-\sum _{j=1}^{k}(a_{k-j}-}$ ${\displaystyle \lambda hb_{k-j})z^{k-j}=0}$

The region R of absolute stability for a multistep method is

${\displaystyle R=}$${\displaystyle \{h\lambda \in \mathbb {C} ||\beta _{j}|<1,{\text{ for all zeros }}\beta _{j}{\text{ of }}Q(z,h\lambda )\}}$.

### Example

Determine the region of absolute stability for two step method ${\displaystyle w_{i+1}=w_{i}+h/2(3f_{i}-f_{i-1})}$.

Applying this method to: ${\displaystyle y'=\lambda y}$, gives

${\displaystyle w_{i+1}=w_{i}+\lambda h(3w_{i}-w_{i-1})/2}$
${\displaystyle \Leftrightarrow w_{i+1}-(1+3h\lambda /2)w_{i}+\lambda h/2w_{i-1}=0\,.}$

The characteristic polynominal of above method is

${\displaystyle Q(z,h\lambda )=z^{2}-(1+3h\lambda /2)z+h\lambda /2}$

All the zeros of the characteristic polynominal are

${\displaystyle z_{1,2}={+(1+3h\lambda /2)\pm {\sqrt {1+\lambda h+9\lambda ^{2}h^{2}/4}} \over 2}\,.}$

Thus the region of absolute stability for this method is ${\displaystyle R=}$${\displaystyle \{h\lambda \in \mathbb {C} ||z_{1,2}|<1\}}$.

# Exercises

## Exercise 1

Find the region of the absolute stability of Euler's method:

${\displaystyle w_{k+1}=w_{k}+hf(t_{k},w_{k}).}$

## Exercise 2

Find the region R of the absolute stability of Trapezoidal method

${\displaystyle w_{k+1}=w_{k}+h/2(f(t_{k},w_{k})+f(t_{k+1},w_{k+1})).}$

## Exercise 3

Make a table of the interval of absolute stability for four one-step methods: Euler's method, Backward- Euler, M-Euler and Trapezoidal method.

## Exercise 4

Find the Region of absolute stability of Adams-Bashforth explict Four-step Method

${\displaystyle w_{n+1}=w_{n}+(h/24)(55f_{n}-59f_{n-1}+37f_{n-2}-9f_{n-3})\,.}$

# Quiz

The following is a quiz covering information presented on the associated multistep method.

1

True or False: The multistep methods are always stable methods.

 TRUE. FALSE.

2

True or False: If the multistep method is strongly stable then it is weakly stable.

 TRUE. FALSE.

3

Check all that apply: Which of the following statements are right?...

 The root condition can always be satisfied for the multistep method. Methods that satisfy the root condition and have more than one distinct root with magnitude one are called strongly stable. Methods that do not satisfy the root condition are unstable. The Euler's method and the Backward Euler method have the same region of absolute stability.

4

Given the following ODE method

${\displaystyle y'=-e^{x}y+x+1,0\leq x\leq 1}$

${\displaystyle y(0)=1}$,

then which h make sure the absolute stability of the method.

 ${\displaystyle h>0}$ ${\displaystyle 0 ${\displaystyle 0 ${\displaystyle h>e}$