DERIVATION OF CONTINUOUS LINEAR MULTISTEP METHODS FOR INITIAL VALUE PROBLEMS OF FIRST ORDER ORDINARY DIFFERENTIAL EQUATION

Show simple item record

dc.contributor.author OLUWATOSIN, EBENEZER AYODELE
dc.date.accessioned 2026-04-13T11:20:39Z
dc.date.available 2026-04-13T11:20:39Z
dc.date.issued 2006-06-25
dc.identifier.uri http://196.220.128.81:8080/xmlui/handle/123456789/5836
dc.description vii.: 55p.: ill.; 32cm en_US
dc.description.abstract In this work, a class of numerical methods with step numbers k > 1 is studied to solve initial value problems of first order ordinary differential equations. Four new linear multistep collocation methods were developed. Collocations were taken at even grid points for even k, while for odd k, collocations were taken at odd grid points. For maximal order method k = 4 collocation were taken at all grid points. In both cases interpolations were taken at all the grid points except the last grid point. At X=Xn+k the discrete methods obtained are symmetric for even k and of order p = 3, 4, 6 and 8 respectively. The methods are consistent but not zero stable. This is so because the interpolation points were not restricted to a single point Xn+k-1 or Xn as it is in Adams methods. The accuracy of the methods was tested, using linear and non-linear first order sample problems. The results show a Significant improvement over the existing methods in terms of accuracy. It is also striking to note that orders of accuracy of the correctors and predictor are equal for corresponding step numbers. en_US
dc.language.iso en en_US
dc.publisher Federal University Of Technology, Akure, Nigeria en_US
dc.subject LINEAR MULTI-STEP en_US
dc.subject DIFFERENTIAL EQUATION en_US
dc.title DERIVATION OF CONTINUOUS LINEAR MULTISTEP METHODS FOR INITIAL VALUE PROBLEMS OF FIRST ORDER ORDINARY DIFFERENTIAL EQUATION en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search FUTAspace


Advanced Search

Browse

My Account