This tutorial was made solely for the purpose of education and it was designed for students taking Applied Math 0330. It is primarily for students who have very little experience or have never used Mathematica and programming before and would like to learn more of the basics for this computer algebra system. As a friendly reminder, don't forget to clear variables in use and/or the kernel. The Mathematica commands in this tutorial are all written in bold black font, while Mathematica output is in normal font.

Finally, you can copy and paste all commands into your Mathematica notebook, change the parameters, and run them because the tutorial is under the terms of the GNU General Public License (GPL). You, as the user, are free to use the scripts for your needs to learn the Mathematica program, and have the right to distribute this tutorial and refer to this tutorial as long as this tutorial is accredited appropriately. The tutorial accompanies the textbook Applied Differential Equations. The Primary Course by Vladimir Dobrushkin, CRC Press, 2015;

Return to computing page for the first course APMA0330
Return to computing page for the second course APMA0340
Return to Mathematica tutorial for the second course APMA0340
Return to Mathematica tutorial for the first course APMA0330
Return to the main page for the second course APMA0340
Return to the main page for the first course APMA0330
Return to Part III of the course APMA0330

Hamming Method

In 1959, Richard Wesley Hamming (1915--1998) from Bell Telephone Laboratories, Murray Hill, New Jersey, proposed a stable predictor-corrector method for ordinary differential equations, which now bears his name. He improved classical Milne--Simpson method by replacing unstable corrector rule by a stable one.
Journal of the ACM, Volume 6, Issue 1, Jan. 1959, pages 37--47.

The Hamming multistep method is used to approximate solution of the initial vaue problem \( y' = f(x,y), \quad y(x_0 ) = y_0 \) over interval [a,b] (where usually x0 = a) by using the predictor
\[ p_{n+1} = y_{n-3} + \frac{4h}{3} \left( 2\,f_{n-2} - f_{n-1} + 2\,f_n \right) , \qquad n=3,4,\ldots . \]
and the corrector
\[ y_{n+1} = \frac{9\, y_n - y_{n-2}}{8} + \frac{3h}{8} \left( f_{n+1} - f_{n-1} + 2\,f_n \right) , \qquad n=3,4,\ldots . \]
As usual, we implement a unifom grid \( x_n = x_0 + n\,h , \) with step length h. Here yn is an approximation to the true value \( \phi (x_n ) \) of the actual solution \( y = \phi (x) . \)

Example. Let us start with the Riccati equation \( y' = x^2 + y^2 \) subject to the initial condition \( y(0) =-1 . \) Its solution is expressed through Bessel functions:

\[ d(x)\, y(x) = J_{-3/4} \left( \frac{x^2}{2} \right) \left( \Gamma^2 \left( \frac{3}{4} \right) + \pi \right) - Y_{-3/4} \left( \frac{x^2}{2} \right) \Gamma^2 \left( \frac{3}{4} \right) . \]
where the denominator
\[ d(x) = Y_{1/4} \left( \frac{x^2}{2} \right) \Gamma^2 \left( \frac{3}{4} \right) - J_{1/4} \left( \frac{x^2}{2} \right) \left( \Gamma^2 \left( \frac{3}{4} \right) +\pi \right) \]
has the first positive null at x = 2.223378383 as the figure shows
d[x_] = BesselY[1/4, x^2 /2]*Gamma[3/4]^2 - BesselJ[1/4, x^2 /2]*(Gamma[3/4]^2 + Pi)
Plot[d[x], {x, 0, 5.5}, PlotStyle -> Thick]
The sollution blows up near the point 2.223378.

Program (Hamming method): to approximate the solution of the initial value problem \( y' = f(x,y) , \ y(a) = y_0 \) over the interval [a,b] by using the predictor

\[ p_{k+1} = y_k-3} + \frac{4h}{3} \left( 2\,f_{k-2} - f_{k-1} + 2\,f_k \right) \]
and the corrector
\[ y_{k+1} = \frac{9\,y_k - y_{k-2}}{8} + \frac{3h}{8} \left( 2\,f_{k} - f_{k-1} + f_{k=1} \right) . \]

function H=hamming(f,T,Y)
% Input  -- f is the slope function entered as a string 'f'
%        -- T is the vector of abscissas
%        -- Y is the vector of ordinates
% Remark -- the first four coordinates of T aand Y must have starting values obtained with RK4

% Output -- H=[T',Y'] where T is the vector of abscissas; Y is the vector of ordinates
if n<5, break,end; 
for k=4:n-1
    % predictor
    pnew=Y(k-3)+(4*h/3)*(F(2:4)*[2 -1 2]');
    % modifier 
    F=[F(2) F(3) F(4) feval(f,T(k+1),pmod)]; 
    % corrector 
    cnew=(9*Y(k)-Y(k-2)+3*h*(F(2:4)*[-1 2 1]'))/8; 
H=[T' Y'];




Return to Mathematica page

Return to the main page (APMA0330)
Return to the Part 1 (Plotting)
Return to the Part 2 (First Order ODEs)
Return to the Part 3 (Numerical Methods)
Return to the Part 4 (Second and Higher Order ODEs)
Return to the Part 5 (Series and Recurrences)
Return to the Part 6 (Laplace Transform)
Return to the Part 7 (Boundary Value Problems)