Please use this identifier to cite or link to this item:
http://ir.futminna.edu.ng:8080/jspui/handle/123456789/2574
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Akintububo, Ben. G | - |
dc.contributor.author | Mohammed, Umaru | - |
dc.date.accessioned | 2021-06-10T16:36:31Z | - |
dc.date.available | 2021-06-10T16:36:31Z | - |
dc.date.issued | 2019-09-24 | - |
dc.identifier.citation | B. Akintububo and U. Mohammed (2019) A 2-Step Hybrid Block Backward Differentiation Formula for the Approximation of Initial Value Problems of ODE. Proceeding of 3rd international Engineering Conference (IEC 2019). pp 250-254. | en_US |
dc.identifier.uri | http://repository.futminna.edu.ng:8080/jspui/handle/123456789/2574 | - |
dc.description.abstract | In this paper, a two-step hybrid backward differentiation formula, with two off-grid points incorporated at interpolation for the solution of initial value problems of ordinary differential equations is presented. The main method as well as the additional methods are obtained from the same continuous scheme formulated using interpolation and collocation methods with Legendre polynomial as the basis function. The method is seen to be of uniform order k=4. The stability of the proposed method is analyzed and discussed. Numerical experiments were carried out to ascertain the effectiveness of the method in comparison with the approximation produced by some existing methods. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Proceeding of 3rd international Engineering Conference (IEC 2019) | en_US |
dc.relation.ispartofseries | ;250-254 | - |
dc.subject | BDF | en_US |
dc.subject | Continuous Collocation | en_US |
dc.subject | IVP | en_US |
dc.subject | Legendre polynomial | en_US |
dc.title | A 2-STEP HYBRID BLOCK BACKWARD DIFFERENTIATION FORMULA FOR THE APPROXIMATION OF INITIAL VALUE PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS | en_US |
dc.type | Presentation | en_US |
Appears in Collections: | Mathematics |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.