Continuous Block Hybrid-Predictor-Corrector method for the solution of y = f (x, y, y )

Similar documents
Modified block method for the direct solution of second order ordinary differential equations

Block Algorithm for General Third Order Ordinary Differential Equation

One-Step Hybrid Block Method with One Generalized Off-Step Points for Direct Solution of Second Order Ordinary Differential Equations

One Step Continuous Hybrid Block Method for the Solution of

Z. Omar. Department of Mathematics School of Quantitative Sciences College of Art and Sciences Univeristi Utara Malaysia, Malaysia. Ra ft.

Runge Kutta Collocation Method for the Solution of First Order Ordinary Differential Equations

PAijpam.eu NEW SELF-STARTING APPROACH FOR SOLVING SPECIAL THIRD ORDER INITIAL VALUE PROBLEMS

Uniform Order Legendre Approach for Continuous Hybrid Block Methods for the Solution of First Order Ordinary Differential Equations

Two Step Hybrid Block Method with Two Generalized Off-step Points for Solving Second Ordinary Order Differential Equations Directly

On Nonlinear Methods for Stiff and Singular First Order Initial Value Problems

Solution of First Order Initial Value Problem by Sixth Order Predictor Corrector Method

Adebayo O. Adeniran1, Saheed O. Akindeinde2 and Babatunde S. Ogundare2 * Contents. 1. Introduction

Research Article An Accurate Block Hybrid Collocation Method for Third Order Ordinary Differential Equations

CONVERGENCE PROPERTIES OF THE MODIFIED NUMEROV RELATED BLOCK METHODS

A NEW INTEGRATOR FOR SPECIAL THIRD ORDER DIFFERENTIAL EQUATIONS WITH APPLICATION TO THIN FILM FLOW PROBLEM

A Zero-Stable Block Method for the Solution of Third Order Ordinary Differential Equations.

Fourth Order RK-Method

arxiv: v1 [math.na] 31 Oct 2016

Block Milne s Implementation For Solving Fourth Order Ordinary Differential Equations

Sixth-Order and Fourth-Order Hybrid Boundary Value Methods for Systems of Boundary Value Problems

DIRECTLY SOLVING SECOND ORDER LINEAR BOUNDARY VALUE PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS. Ra ft Abdelrahim 1, Z. Omar 2

A Family of L(α) stable Block Methods for Stiff Ordinary Differential Equations

Applied Math for Engineers

Five Steps Block Predictor-Block Corrector Method for the Solution of ( )

-Stable Second Derivative Block Multistep Formula for Stiff Initial Value Problems

A Class of an Implicit Stage-two Rational Runge-Kutta Method for Solution of Ordinary Differential Equations

Aug Vol. 5. No. 03 International Journal of Engineering and Applied Sciences EAAS & ARF. All rights reserved

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK

A Family of Block Methods Derived from TOM and BDF Pairs for Stiff Ordinary Differential Equations

A FAMILY OF EXPONENTIALLY FITTED MULTIDERIVATIVE METHOD FOR STIFF DIFFERENTIAL EQUATIONS

COSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods

(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).

AP Calculus Testbank (Chapter 9) (Mr. Surowski)

Construction and Implementation of Optimal 8 Step Linear Multistep

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods

369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 2017 pp

multistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):

Combining Like Terms in Polynomials

Hybrid Methods for Solving Differential Equations

Virtual University of Pakistan

An Accurate Self-Starting Initial Value Solvers for. Second Order Ordinary Differential Equations

Research Article Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations

Differential Equations

Generalized RK Integrators for Solving Ordinary Differential Equations: A Survey & Comparison Study

Jim Lambers MAT 772 Fall Semester Lecture 21 Notes

Mathematics for chemical engineers. Numerical solution of ordinary differential equations

Research Article P-Stable Higher Derivative Methods with Minimal Phase-Lag for Solving Second Order Differential Equations

Four Point Gauss Quadrature Runge Kuta Method Of Order 8 For Ordinary Differential Equations

Math 128A Spring 2003 Week 12 Solutions

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science

A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS FOR STIFF IVPs IN ODEs

ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations

G-SPLINE INTERPOLATION FOR APPROXIMATING THE SOLUTION OF FRACTIONAL DIFFERENTIAL EQUATIONS USING LINEAR MULTI- STEP METHODS

On One Justification on the Use of Hybrids for the Solution of First Order Initial Value Problems of Ordinary Differential Equations

Math 113 (Calculus 2) Exam 4

Section Taylor and Maclaurin Series

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods

Reformulation of Block Implicit Linear Multistep Method into Runge Kutta Type Method for Initial Value Problem

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0

SOLVING NONLINEAR EQUATIONS USING A NEW TENTH-AND SEVENTH-ORDER METHODS FREE FROM SECOND DERIVATIVE M.A. Hafiz 1, Salwa M.H.

Part IB Numerical Analysis

Initial value problems for ordinary differential equations

Numerical Methods - Initial Value Problems for ODEs

QUINTIC SPLINE SOLUTIONS OF FOURTH ORDER BOUNDARY-VALUE PROBLEMS

Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction

Predictor Corrector Methods of High Order for Numerical Integration of Initial Value Problems

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES

MTH 452/552 Homework 3

Unit I (Testing of Hypothesis)

Continuous Hybrid Multistep Methods with Legendre Basis Function for Direct Treatment of Second Order Stiff ODEs

9.6 Predictor-Corrector Methods

Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations

A NOTE ON EXPLICIT THREE-DERIVATIVE RUNGE-KUTTA METHODS (ThDRK)

Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.

2 Series Solutions near a Regular Singular Point

Chebyshev-Halley s Method without Second Derivative of Eight-Order Convergence

Modeling Data with Linear Combinations of Basis Functions. Read Chapter 3 in the text by Bishop

Adding and Subtracting Polynomials Add and Subtract Polynomials by doing the following: Combine like terms

Review Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester

Review: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function.

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Completion Date: Monday February 11, 2008

HIGHER ORDER METHODS. There are two principal means to derive higher order methods. b j f(x n j,y n j )

Fifth-Order Improved Runge-Kutta Method With Reduced Number of Function Evaluations

Review of Power Series

New Seven-Step Numerical Method for Direct Solution of Fourth Order Ordinary Differential Equations

Solving Delay Differential Equations (DDEs) using Nakashima s 2 Stages 4 th Order Pseudo-Runge-Kutta Method

Continuous implicit method for tbe solution of genera) second order ordinary differential equations

Math Exam 2, October 14, 2008

On the Computational Procedure of Solving Boundary Value Problems of Class M Using the Power Series Method

Exponentially Fitted Error Correction Methods for Solving Initial Value Problems

Numerical Differential Equations: IVP

Math 246, Spring 2011, Professor David Levermore

Math 112 Rahman. Week Taylor Series Suppose the function f has the following power series:

TS Method Summary. T k (x,y j 1 ) f(x j 1,y j 1 )+ 2 f (x j 1,y j 1 ) + k 1

Math 175 Common Exam 2A Spring 2018

Math 660 Lecture 4: FDM for evolutionary equations: ODE solvers

Interpolation and the Lagrange Polynomial

Second Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177

NEW ITERATIVE METHODS BASED ON SPLINE FUNCTIONS FOR SOLVING NONLINEAR EQUATIONS

Transcription:

International Journal of Mathematics and Soft Computing Vol., No. 0), 5-4. ISSN 49-8 Continuous Block Hybrid-Predictor-Corrector method for the solution of y = f x, y, y ) A.O. Adesanya, M.R. Odekunle Department of Mathematics, Modibbo Adama University of Technology, Yola, Adamawa State, NIGERIA. A.O. Adeyeye Department of Mathematical Sciences, Federal University of Technology, Akure, Ondo State, NIGERIA. Abstract A method of collocation and interpolation of the power series approximate solution at some grid and off-grid points is considered to generate a continuous linear multistep method for the solution of general second order initial value problems at constant step size. We use continuous block method to generate independent solutions which serves as predictors at selected points within the interval of integration. The efficiency of the proposed method was tested and was found to compete favorably with the existing methods. Keywords: Collocation, interpolation, power series approximant, grid points, off grid points, continuous block method. AMS Subject Classification00): 65L05, 65L06, 65D0. Introduction This paper considers the solution to general second order initial value problem of the form y = f x, y x), y x) ), y x 0 ) = y 0, y x 0 ) = y 0 ) Awoyemi,, 5], Kayode 8, 9], Adesanya, Anake and Udoh ] have studied the direct solution to ). They proposed continuous linear multistep methods which were implemented in predictor-corrector mode. Continuous methods have the advantage of evaluating at all points within the integration interval, thus reduces the computational burden when evaluation is required at more than one point within the grid. They developed a separate reducing order of accuracy predictors and adopted Taylor series expansion to provide the starting values in order to implement the corrector. Jator 6], Jator and Li 7], Omar and Sulaiman 0], Awoyemi, Adebile, Adesanya and Anake 4], Zarina, Mohammed and Iskanla ] have proposed discrete block method of the form A 0) Y m = ey n + h µ df y n ) + h µ bf Y m ) ) to cater for the setback of the predictor corrector method. In this paper, we propose a continuous block formular which has an advantage of evaluating at all the points within the interval of integration. It has the same properties as the continuous linear multistep 5

6 A.O. Adesanya, M.R. Odekunle and A.O. Adeyeye method which is extensively discussed by Awoyemi,, 5]. The continuous block method is evaluated at selected grid points to generate the discrete block ) which serve as a predictor for the hybrid linear multistep method which is the corrector. Methodology. Development of continuous hybrid linear multistep Consider a monomial power series as the approximate solution in the form yx) = r+s ) a j x j ) The second derivative of ) gives y x) = r+s j= j j ) a j x j 4) where s and r are the number of interpolating points. Substituting 4) in ) we get f x, yx), y x) ) = r+s j= j j ) a j x j 5) x a, b], a j s are the parameters to be determined. The step size h) is given as h = x n+i x n, n = 0 ) N. Interpolating ) at x = x n+s, s = 0 ) and collocating 5) at x = x n+r, r = 0 ) gives a system of equations AX = U x n x n x n x 4 n x 5 n x 6 n x 7 n x 8 n x n+ x x x 4 x 5 x 6 x 7 x 8 n+ n+ n+ n+ n+ n+ n+ x n+ x n+ x n+ x 4 n+ x 5 n+ x 6 n+ x 7 n+ x 8 n+ x n+ x x x 4 x 5 x 6 x 7 x 8 n+ n+ n+ n+ n+ n+ n+ A = 0 0 6x n x n 0x n 0x 4 n 4x 5 n 56x 6 n 0 0 6x n+ x 0x 0x 4 4x 5 56x 6 n+ n+ n+ n+ n+ 0 0 6x n+ x n+ 0x n+ 0x 4 n+ 4x 5 n+ 56x 6 n+ 0 0 6x n+ x 0x 0x 4 4x 5 56x 6 n+ n+ n+ n+ n+ 0 0 6x n+ x n+ 0x n+ 0x 4 n+ 4x 5 n+ 56x 6 n+ X = a 0 a a a a 4 a 5 a 7 a 8 6)

Continuous Block Hybrid-Predictor-Corrector method for the solution of y = f x, y, y ) 7 U = y n y n+ y n+ y n+ f n f n+ f n+ f n+ f n+ Solving 6)for a j s using Gaussian elimination method and substituting in ) gives a continuous hybrid linear multistep method in the form where t = x xn h y t) = α j t) y n+j + α t) y n+ + α t) y n+ +β t) f n+ + β t) f n+ + h β j t) f n+j 7) α 0 = 8t 7 896t 6 + 5t 5 800t 4 + 44t 49t + ) 688t 8 0096t 7 + 596t 6 8704t 5 + 6646t 4 48t + 78t ) α = 7 α = 7 576t8 64t 7 + 90496t 6 06t 5 + 460t 4 40t 79t) α = 65 8064t8 55t 7 + 856t 6 548t 5 + 5648t 4 + 4784t 75t) β 0 = 780 008t8 5968t 7 + 896t 6 0059t 5 + 47t 4 554t + 9060t 4t) β = 9765 04t8 6984t 7 497t 6 + 80t 5 595t 4 + 58t 9774t) β = 440 0864t8 7044t 7 + 60888t 6 44704t 5 + 94t 4 + 808t + 45t) β = 9765 04t8 984t 7 + 4488t 6 48t 5 + 788t 4 + 808t 846t) β = 60 44t8 864t 7 + 98t 6 87t 5 + 6t 4 + 78t 7t) Evaluating 7) at t = 4, we have y n+ = y n 8 y n+ + h 00 + 8 y n+ 8 y n+ ) f n + 688f n+ + 58f n+ + 688f n+ + f n+ 8). Development of continuous block predictor Interpolating ) at x = x n+s, s = 0, and collocating 5) at x = x n+r, r = 0 ) gives a system of equations in the form of 5) where x n x n x n x 4 n x 5 n x 6 n x n+ x n+ x n+ x 4 n+ x 5 n+ x 6 n+ 0 0 6x n x n 0x n 0x 4 n A = 0 0 6x n+ x 0x 0x 4 n+ n+ n+ 0 0 6x n+ x n+ 0x n+ 0x 4 n+ 0 0 6x n+ x 0x 0x 4 n+ n+ n+ 0 0 6x n+ x n+ 0x n+ 0x 4 n+

8 A.O. Adesanya, M.R. Odekunle and A.O. Adeyeye X = a 0 a a a a 4 a 5 a 6 U = y n y n+ f n f n+ f n+ f n+ f n+ Solving for a js gives a continuous hybrid linear multistep method in the form y t) = α j t) y n+j + h β j t) f n+j + β t) f n+ + β t) f n+ 9) where t = x x n h α 0 = t, α = t β 0 = 8t 6 60t 5 + 75t 4 50t + 80t 5t ) 60 β = 4t 6 7t 5 + 65t 4 60t + 8t ) 8t 6 48t 5 + 95t 4 60t + 5t ) β = 60 β = 4t 6 t 5 + 5t 4 0t + t ) β = 60 8t6 6t 5 + 55t 4 0t + t). Solving for the independent solution y n+r, r = ), gives a continuous hybrid block Y m) t) = jh) m yn m + h µ m! σ j t) f n+j + h µ σ t) f n+ + h µ σ t) f n+ 0) where the coefficient of f n+j are given by σ 0 = 8t 6 7t 5 + 75t 4 56t + 80t ) 60 σ = 4t 6 7t 5 + 65t 4 60t ) σ = 8t 6 48t 5 + 95t 4 60t ) 60 σ = 4t 6 t 5 + 5t 4 0t ) σ = 60 8t6 6t 5 + 55t 4 0t ). Evaluating 0) at t = 0 ) gives a discrete block method in the form of equation ), d = 67 5760 5 60 47 640 4 5 440 9 80 7 60 7

Continuous Block Hybrid-Predictor-Corrector method for the solution of y = f x, y, y ) 9 b = 47 5 960 9 440 7 60 7 0 6 5 70 4 5 60 6 5 70 5 5 80 9 0 80 7 90 0 9 640 0 9 440 80 60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 e = 0 0 0 0 0 0 0 0 0 0 0 0 0, 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 5 7 T A 0 = 8 8 identity matrix. Analysis of the basic properties of the block. Order of the method We define a linear operator on 7) to give L{yx) : h} = yx) α j t) y n+j + α t) y n+ + α h β j t) f n+j + β t) f n+ + β t) y n+ + t) f n+ ] ) Expanding y n+j and f n+j in Taylor series expansion and comparing the coefficient of h gives L{yx) : h} = C 0 yx) + C hy x) +... + C p h p y p x) + C p+ h p+ y p+ x) +C p+ h p+ y p+ x) +... ) Definition.. The difference operator L and the associated continuous linear multistep method 9) are said to be of order p if C 0 = C =... = C p = C p+ = 0 and C p+ is called the error constant and implies that the local truncation error is given by t n+k = C p+ h p+) y p+) x) + O h p+). The order of the proposed discrete scheme is 8, with error constant C p+ =. Consistency 79 59996600. A linear multistep method 7) is said to be consistent if it has order p and if ρ) = ρ ) = 0 and ρ ) =!σ) where ρr) is the first characteristic polynomial and σr) is the second characteristic polynomial. For the proposed method, ρr) = r + 8 r 8 r + 8 r + and

40 A.O. Adesanya, M.R. Odekunle and A.O. Adeyeye ) σr) = 465 r + 688r + 58r + 688r +. Clearly ρ) = ρ ) = 0 and ρ ) =!σ). Hence the proposed method is consistent.. Zero stability A linear multistep method is said to be zero stable, if the zeros of the first characteristic polynomial ρr) satisfies r and is simple for r =. For the proposed method, one of the roots of the first characteristic polynomial is 5.9. Hence the proposed method is not zero stable..4 Stability interval The method 7) is said to be absolute stable if for a given h, all roots z s of the characteristic polynomial π z, h) = ρ z) + h σ z) = 0, satisfies z s <, s =,,..., n. where h = λ h and λ = f y.. The boundary locus method is adopted to determine the region of absolute stability. Substituting the test equation y = λ h in 7) and substituting r = cos θ + i sin θ gives the stability region 0.4, 0] after evaluating hθ) at an interval of 0 0 in 0, 80 0]. 4 Numerical Experiments 4. Test Problems We test the proposed method with second order initial value problems. Problem : Consider the non-linear initial value problem I.V.P) y xy ) = 0, y0) =, y 0) =.h = 0.05 ) Exact solution: yx) = + ln +x x. This problem was solved by Awoyemi 5] where a method of order 8 is proposed and it is implemented in predictor-corrector mode with h = /0. Jator 6] also solved this problem in block method where a block of order 6 and step-length of 5 is proposed with h = 0.05. We compared the result with these two results as shown in Table. Problem : We consider the non-linear initial value problem I.V.P) y = y ) y y, y π 6 ) = 4, y π 6 ) =. Exact solution:sin x). This problem was solved by Awoyemi 5] where a method of order 8 is proposed and it is implemented in predictor-corrector mode with h = /0. Jator 6] also solved this problem in block method where a block of order 6 and step-length of 5 is proposed with h = 0.049. We compared the result with these two results as shown in Table.

Continuous Block Hybrid-Predictor-Corrector method for the solution of y = f x, y, y ) 4 Table for Problem x Exact result Computed result Error Error in 4] Error in 6] 0..050047978.050047977 7.508-) 6.69-4) 7.69-) 0..005477.005477 9.740-).00-0).509-) 0..5404596.54045898.768-).700-09) 4.586-) 0.4.07554054.0755956 9.7765-) 5.8946-09).0808-0) 0.5.554888.5548674.085-0).444-08).788-0) 0.6.09596040.095960807.9604-0) 4.866-08) 4.444-0) 0.7.65447547.654475566 7.0460-0) 5.09-08) 7.4446-0) 0.8.4648909.464898984.095-09) 9.-08).5009-09) 0.9.48470078594.4847007654.05-09).494-07).7579-09).0.54906444.549064087.5066-09).78-07) 4.740-09) Table for Problem x Exact result Computed result Error Error in 5] Error in 9].05988 0.7975508880 0.797550869.88-0) 4.6-07).8047-0).05988 0.8787 0.8786867.9-0) 4.5866-07).7950-0).05988 0.908846746 0.90884644.006-0) 4.098-07).490-0).405988 0.970046 0.970090.589-0).695-07) 5.4975-).505988 0.99549865 0.9954986 4.088-0) 4.559-08).5-0).605988 0.9989485 0.998948477 4.58-0) 4.8054-07) 4.485-0).705988 0.9846694808 0.984669475 4.847-0).0-06) 7.7969-0).805988 0.94677507609 0.94677507560 5.0696-0).6785-06).840-09).905988 0.89769795 0.8976978 5.697-0).857-06).68-09).005988 0.840898067 0.84089805657 5.8-0).08-06).0567-09) 5 Conclusion In this paper we have proposed a two-step two-point hybrid method. Continuous block method which has the properties of evaluation at all points with the interval of integration is adopted to give the independent solution at non overlapping intervals as the predictor to an order eight corrector. This new method forms a bridge between the predictor-corrector method and block method. Hence it shares the properties of both the methods. The new method performed better than the block method and the predictor corrector method. Therefore we recommend this method in developing numerical methods for the solutions of initial value problems of ordinary differential equations. References ] A. O. Adesanya, T.A. Anake, M.O. Udoh, Improved continuous method for direct solution of general second order ordinary differential equation, J. of Nigerian Association of Mathematical Physics, 008), 59-6. ] D. O. Awoyemi, A new sixth order algorithms for general second order ordinary differential equation, Int. J. Computer Math., 7700), 7 4.

4 A.O. Adesanya, M.R. Odekunle and A.O. Adeyeye ] D. O. Awoyemi, A p-stable linear multistep method for solving third order ordinary differential equation, Inter. J. Computer Math. 808)00), 85 99. 4] D. O. Awoyemi, E. A. Adebile, A. O. Adesanya, Anake, T. A., Modified block method for the direct solution of second order ordinary differential equation, Int. J. of Applied Mathematics and Computation, )0), 8-88. 5] D. O. Awoyemi, M. O. Idowu, A class of hybrid collocation method for third order ordinary differential equation, Int. J. of Comp. Math.80)005), 87-9. 6] S. N. Jator, A sixth order linear multistep method for direct solution of y = fx, y, y ), Int. J. of Pure and Applied Mathematics, 40)007), 7-47. 7] S. N. Jator, J. Li, A self starting linear multistep method for the direct solution of the general second order initial value problems, Int. J. of Comp. Math., 865)009), 87-86. 8] S. J. Kayode, A zero stable method for direct solution of fourth order ordinary differential equations, American Journal of Applied Sciences., 5)009), 46 466. 9] S. J. Kayode, Awoyemi, D. O., A multiderivative collocation method for fifth order ordinary differential equation, J. of Mathematics and Statistics, 6)00), 60-6. 0] Z. Omar, M. Suleiman, Parallel R-point implicit block method for solving higher order ordinary differential equation directly., Journal of ICT, )00), 5-66. ] B. I. Zarina, S. Mohamed, I. O. Iskanla, Direct block backward differentiation formulas for solving second order ordinary differential equation, Journal of Mathematics and Computation Sciences )009), 0.