The linear multi-step method in this work is established to be a numeric fixed point iterative method for
solving the initial value problem.
Such that when βk ̸= 0, the method is called implicit or otherwise, it is called an explicit method. In section one, preliminaries of the linear multi-step methods bordering on the truncation errors and consistency
conditions were discussed while section two is devoted to theoretical presentation of the usual Hamming’s
method as a fixed point iterative method via the Banach contraction mapping principle. In the end we then
examined extensively the application of the method in the solution of an initial value problem of the ordinary differential equation type using FORTRAN programming language and confirmed it to be a fixed point
iterative method in the complete metric space.
Pearl, P. (2019). ON HAMMING’S LINEAR MULTI-STEP FIXED POINT ITERATIVE METHOD AND ITS APPLICATION IN THE SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS. Afribary. Retrieved from https://tracking.afribary.com/works/hammings
Pearl, Precy "ON HAMMING’S LINEAR MULTI-STEP FIXED POINT ITERATIVE METHOD AND ITS APPLICATION IN THE SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS" Afribary. Afribary, 21 Aug. 2019, https://tracking.afribary.com/works/hammings. Accessed 26 Dec. 2024.
Pearl, Precy . "ON HAMMING’S LINEAR MULTI-STEP FIXED POINT ITERATIVE METHOD AND ITS APPLICATION IN THE SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS". Afribary, Afribary, 21 Aug. 2019. Web. 26 Dec. 2024. < https://tracking.afribary.com/works/hammings >.
Pearl, Precy . "ON HAMMING’S LINEAR MULTI-STEP FIXED POINT ITERATIVE METHOD AND ITS APPLICATION IN THE SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS" Afribary (2019). Accessed December 26, 2024. https://tracking.afribary.com/works/hammings