A Class of Block Multi-Step Methods for the Solutions of Ordinary Differential Equation (Ode)

Date

2016-04-13

Journal Title

Journal ISSN

Volume Title

Publisher

Department of Mathematical Science, Nasarawa State University Keffi.

Abstract

In this research, an attempt is made to derive a self starting block procedure for some K-step linear multi-step methods (for K=1, 2 and 3), using Chebyshev polynomial as the basis function. The continuous interpolant were derived and collocated at grid and off-grid points to give the discrete methods used in block and applied simultaneously for the solution of non stiff initial value problem.The regions of absolute stability of the methods are plotted and are shown to be A (α) stable. The methods for K=2 and K=3 were experimented on initial value problems and the results reveal that the newly constructed block methods have good error stability and are efficient.

Description

Keywords

Collocation methods, Initial Value Problems, Chebyshev Polynomials, Perturbation Function, Convergence and Stability

Citation

[1]. Dahlquist G. and Jorck A. B.(1974), Numerical Methods. Englewood Cliffs, N. J; Prentice hall. Pp 221-224 [2]. Fox L and Parker I. B., (1972), Chebyshev Polynomials in Numerical Analysis. University Press, Belfast, Northern Ireland. Pp 3, 22-25. [3]. Jain M. K. (1979), Numerical Solutions of Differential Equations. Wiley Eastern Limited. NewDelhi. Pp 107-140 [4]. Lambert J. D. (1973), Computational Methods in ODEs. John Wiley and Sons, New York. Pp 13. [5]. Williams P. W. (1972), Numerical Computation. Thomas Nelson and Sons Ltd, 36 Park Street,London WIY 4DE. Pp 93.

Collections