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

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

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

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

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

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

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

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

Numerical Analysis MTH603. dy dt = = (0) , y n+1. We obtain yn. Therefore. and. Copyright Virtual University of Pakistan 1

Block Algorithm for General Third Order Ordinary Differential Equation

New Fourth Order Quartic Spline Method for Solving Second Order Boundary Value Problems

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

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

MA2264 -NUMERICAL METHODS UNIT V : INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL. By Dr.T.Kulandaivel Department of Applied Mathematics SVCE

Parameter Fitted Scheme for Singularly Perturbed Delay Differential Equations

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

Differential equations. Differential equations

One Step Continuous Hybrid Block Method for the Solution of

NON STANDARD FITTED FINITE DIFFERENCE METHOD FOR SINGULAR PERTURBATION PROBLEMS USING CUBIC SPLINE

Numerical Differentiation

Physically Based Modeling: Principles and Practice Implicit Methods for Differential Equations

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)

232 Calculus and Structures

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

Runge-Kutta methods. With orders of Taylor methods yet without derivatives of f (t, y(t))

ETNA Kent State University

(5.5) Multistep Methods

Solving Second Order Linear Dirichlet and Neumann Boundary Value Problems by Block Method

Chapter 4: Numerical Methods for Common Mathematical Problems

MATH745 Fall MATH745 Fall

Fourth Order RK-Method

Taylor Series and the Mean Value Theorem of Derivatives

CONVERGENCE PROPERTIES OF THE MODIFIED NUMEROV RELATED BLOCK METHODS

Polynomial Interpolation

College of Art and Sciences Universiti Utara Sintok Kedah, 0060, MALAYSIA

NUMERICAL DIFFERENTIATION

Packing polynomials on multidimensional integer sectors

LECTURE 14 NUMERICAL INTEGRATION. Find

Polynomial Interpolation

An Approximation to the Solution of the Brusselator System by Adomian Decomposition Method and Comparing the Results with Runge-Kutta Method

Click here to see an animation of the derivative

De-Coupler Design for an Interacting Tanks System

Numerical Solution of One Dimensional Nonlinear Longitudinal Oscillations in a Class of Generalized Functions

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

Chapter 1D - Rational Expressions

Department of Statistics & Operations Research, Aligarh Muslim University, Aligarh, India

LIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT

Variance Estimation in Stratified Random Sampling in the Presence of Two Auxiliary Random Variables

Lecture 21. Numerical differentiation. f ( x+h) f ( x) h h

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

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim

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

Blanca Bujanda, Juan Carlos Jorge NEW EFFICIENT TIME INTEGRATORS FOR NON-LINEAR PARABOLIC PROBLEMS

SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY

Implicit-explicit variational integration of highly oscillatory problems

Research Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic Spline Quasi Interpolation

Module 4 Linear Boundary value problems

Continuity and Differentiability Worksheet

lecture 26: Richardson extrapolation

1 Lecture 13: The derivative as a function.

= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c)

160 Chapter 3: Differentiation

MATH1131/1141 Calculus Test S1 v8a

Chapter 5 FINITE DIFFERENCE METHOD (FDM)

Continuity and Differentiability of the Trigonometric Functions

Convexity and Smoothness

PECULIARITIES OF THE WAVE FIELD LOCALIZATION IN THE FUNCTIONALLY GRADED LAYER

AMS 147 Computational Methods and Applications Lecture 09 Copyright by Hongyun Wang, UCSC. Exact value. Effect of round-off error.

MATH1151 Calculus Test S1 v2a

(4.2) -Richardson Extrapolation

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.

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

Research Article Discrete Mixed Petrov-Galerkin Finite Element Method for a Fourth-Order Two-Point Boundary Value Problem

Investigating Euler s Method and Differential Equations to Approximate π. Lindsay Crowl August 2, 2001

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

How to Find the Derivative of a Function: Calculus 1

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines

Lecture 2: Symplectic integrators

Recent Progress in the Integration of Poisson Systems via the Mid Point Rule and Runge Kutta Algorithm

A = h w (1) Error Analysis Physics 141

Department of Mathematical Sciences University of South Carolina Aiken Aiken, SC 29801

Copyright c 2008 Kevin Long

Te comparison of dierent models M i is based on teir relative probabilities, wic can be expressed, again using Bayes' teorem, in terms of prior probab

WYSE Academic Challenge 2004 Sectional Mathematics Solution Set

THE STURM-LIOUVILLE-TRANSFORMATION FOR THE SOLUTION OF VECTOR PARTIAL DIFFERENTIAL EQUATIONS. L. Trautmann, R. Rabenstein

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems

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

Derivatives. if such a limit exists. In this case when such a limit exists, we say that the function f is differentiable.

Research Article Cubic Spline Iterative Method for Poisson s Equation in Cylindrical Polar Coordinates

Flavius Guiaş. X(t + h) = X(t) + F (X(s)) ds.

INTRODUCTION AND MATHEMATICAL CONCEPTS

Parametric Spline Method for Solving Bratu s Problem

ESTIMATION OF A POPULATION MEAN OF A SENSITIVE VARIABLE IN STRATIFIED TWO-PHASE SAMPLING

A SHORT INTRODUCTION TO BANACH LATTICES AND

1. Questions (a) through (e) refer to the graph of the function f given below. (A) 0 (B) 1 (C) 2 (D) 4 (E) does not exist

Problem Solving. Problem Solving Process

SKP Engineering College

Superconvergence of energy-conserving discontinuous Galerkin methods for. linear hyperbolic equations. Abstract

Convexity and Smoothness

Simulation and verification of a plate heat exchanger with a built-in tap water accumulator

Math 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions

Transcription:

Global Journal of Pure and Applied Matematics. ISSN 0973-768 Volume 2, Number 2 (206), pp. 59-535 Researc India Publications ttp://www.ripublication.com/gjpam.tm Two Step Hybrid Block Metod wit Two Generalized Off-step Points for Solving Second Ordinary Order Differential Equations Directly Raed, Abdalreem Department of Pysics, College of Art and Sciences, Jordan University of Science and Tecnology. Moammad, Aldalal a Department of matematics, College of Art and Sciences, Univeristi Utara Malaysia. Abstract In tis paper, te new two step ybrid block metod wit two generalized off-step points for solving second order ordinary differential equation directly as been proposed. In te derivation of te metod, power series of order six is used as basis function to obtain te continuous sceme troug collocation and interpolation tecnique. As required by all numerical metods, te numerical properties of te developed block metod wic include consistent, zero stability, convergent and stability region are also establised. te new metod was found to compare favourably wit te existing metods in term of error. AMS subject classification: 65L05, 65L06, 65L20. Keywords: Block metod, Hybrid metod, Second order differential equation, Collocation and Interpolation, Two off step points.

520 Raed, Abdalreem and Moammad, Aldalal a. Introduction Tis article considered te solution to te general second order initial value problem (IVPs) of te form y f(x,y,y ), y(a) δ 0,y (a) δ.x [a,b]. () Equations () often arises in several areas of science and engineering an suc as biology, pysics and cemical. Generally, tese equations ave not exact solution. Tus, numerical metods become very crucial. In literature, numerous numerical metods for solving Equation () ave been proposed, for example, Euler metod, linear multistep metod, Runge-Kutta, predictor - corrector metod, ybrid metod and block metod (see [3], [5] and [2]). However, tese metods ave teir setbacks wic affects on teir accuracy and efficiency. Recently, ybrid block metods for solving equations () directly ave been proposed. In te latter, te researcers ave tried to combine advantages of direct, block and ybrid metods (see [], [4], [5], [6] and [7]) to overcome te zero stability problem in linear multistep as well as to avoid setbacks in reduction metods and generating numerical results concurrently. 2. Metodology In tis part, two step ybrid block metod wit two generalized off-step points i.e x n+s and x n+r for solving () is derived. Let te approximate solution of () to be te power series polomial of te form: were, y(x) q+d i0 i x [x n,x n+ ] for n 0,, 2,...,N, ( ) x i xn a i. (2) ii q denotes of te number of interpolation points wic is equal to te order of differential equation, iii d represents te number of collocation points, iv x n x n is constant step size of partition of interval [a,b] wic is given by a x 0 <x < <x N <x N b. Differentiating (2) twice gives y (x) f(x,y,y ) q+d i2 i(i ) 2 a i ( ) x i 2 xn. (3)

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 52 Interpolating (2) at x n+s, x n+r and collocating (3) at all points in te selected interval produces seven equations wic can be written in matrix of te form: s s 2 s 3 s 4 s 5 s 6 r r 2 r 3 r 4 r 5 r 6 2 2 2 6s 2s 2 20s 3 30s 4 2 2 2 2 2 2 6r 2r 2 20r 3 30r 4 2 2 2 2 2 2 6 2 20 30 2 2 2 2 2 2 2 48 60 480 2 2 2 2 2 a 0 a a 2 a 3 a 4 a 5 a 6 y n+s y n+r f n f n+s f n+r f n+ f n+2 (4) Employing Gaussian elimination metod to (4) gives te unknown values of a i s, i 0()6 wic are ten substituted back into equation (2) to produce a continuous implicit sceme of te form y(x) α i (x)y n+i + is,r Te first derivative of equation (5) gives were y (x) α s (x n x + r) (r s) α r (x x n s) (r s) is,r x α i(x)y n+i + i0,s,r, i0,s,r, β i (x)f n+i (5) x β i(x)f n+i (6) β 0 (x n x + s)(x n x + r) (20rs 4 ) ( 4 r 4 4 r 3 s 6 4 r 3 4 r 2 s 2 + 9 4 r 2 s +0 4 r 2 4 rs 3 + 9 4 rs 2 30 4 rs + 4 s 4 6 4 s 3 + 0 4 s 2 + 3 r 3 x 3 r 3 x n 3 r 2 sx + 3 r 2 sx n 6 3 r 2 x + 6 3 r 2 x n 3 rs 2 x + 3 rs 2 x n + 9 3 rsx + 0 3 rx

522 Raed, Abdalreem and Moammad, Aldalal a 9 3 rsx n 0 3 rx n + 3 s 3 x 3 s 3 x n 6 3 s 2 x + 6 3 s 2 x n + 0 3 sx 0 3 sx n 6 2 rx 2 + 2 2 rxx n 6 2 rx 2 n + 2 s 2 x 2 2 2 s 2 xx n + 2 s 2 x 2 n 62 sx 2 +2 2 sxx n + 20 2 xx n 0 2 x 2 n + rx3 3rx 2 x n + 3rxx 2 n rx3 n +sx 3 3sx 2 x n + 3sxx 2 n sx3 n 62 sx 2 n 02 x 2 + 2 r 2 x 2 2 2 r 2 xx n + 2 r 2 x 2 n 2 rsx 2 + 2 2 rsxx n 2 rsx 2 n + 9x3 27x 2 x n +27xx 2 n 9x3 n 2x4 + 8x 3 x n 2x 2 x 2 n + 8xx3 n 2x4 n ) β s (x n x + s)(x n x + r) (60 4 s(s )(s 2)(r s)) (4 r 4 + 4 r 3 s 6 4 r 3 + 4 r 2 s 2 6 4 r 2 s +0 4 r 2 + 4 rs 3 6 4 rs 2 + 0 4 rs 2 4 s 4 + 9 4 s 3 0 4 s 2 + 3 r 3 x 3 r 3 x n + 3 r 2 sx 3 r 2 sx n 6 3 r 2 x + 6 3 r 2 x n + 3 rs 2 x 3 rs 2 x n 6 3 rsx + 6 3 rsx n + 0 3 rx 0 3 rx n 2 3 s 3 x + 2 3 s 3 x n + 9 3 s 2 x 9 3 s 2 x n 0 3 sx + 0 3 sx n + 2 r 2 x 2 + 2 r 2 x 2 n + 2 rsx 2 2 2 rsxx n + 2 rsx 2 n 62 rx 2 + 2 2 rxx n 6 2 rx 2 n 22 s 2 x 2 + 9 2 sx 2 8 2 sxx n +9 2 sx 2 n 02 x 2 + 20 2 xx n 0 2 x 2 n + rx3 3rx 2 x n +3rxx 2 n rx3 n 2sx3 + 6sx 2 x n 6sxx 2 n + 2sx3 n + 9x3 27x 2 x n +8xx 3 n 22 r 2 xx n + 4 2 s 2 xx n 2 2 s 2 x 2 n + 27xx2 n 9x3 n 2x4 +8x 3 x n 2x 2 x 2 n 2x4 n ) β r (x n x + s)(x n x + r) (60 4 r(r )(r 2)(r s)) (24 r 4 4 r 3 s 9 4 r 3 4 r 2 s 2 +6 4 r 2 s + 0 4 r 2 4 rs 3 + 6 4 rs 2 0 4 rs 4 s 4 + 6 4 s 3 0 4 s 2 + 6 3 rsx + 0 3 sx n 9 2 rx 2 n + 23 r 3 x 2 3 r 3 x n 3 r 2 sx + 3 r 2 sx n 9 3 r 2 x + 9 3 r 2 x n 3 rs 2 x + 3 rs 2 x n 6 3 rsx n + 0 3 rx 0 3 rx n 3 s 3 x + 3 s 3 x n + 6 3 s 2 x 6 3 s 2 x n 0 3 sx + 2 2 r 2 x 2 4 2 r 2 xx n + 2 2 r 2 x 2 n 2 rsx 2 + 2 2 rsxx n 2 rsx 2 n 92 rx 2 8xx 3 n 2 s 2 x 2 + 2 2 s 2 xx n 2 s 2 x 2 n +6 2 sx 2 2 2 sxx n + 6 2 sx 2 n + 02 x 2 20 2 xx n + 0 2 x 2 n + 2rx3 6rx 2 x n + 6rxx 2 n 2rx3 n sx3 + 3sx 2 x n 3sxx 2 n + sx3 n +8 2 rxx n 9x 3 + 27x 2 x n 27xx 2 n + 9x3 n + 2x4 8x 3 x n +2x 2 x 2 n + 2x4 n ) β (x n x + s)(x n x + r) (60 4 (s )(r )) ( 4 r 4 4 r 3 s 4 4 r 3 4 r 2 s 2 +6 4 r 2 s 4 rs 3 + 6 4 rs 2 + 4 s 4 4 4 s 3 + 3 r 3 x 3 r 3 x n 3 r 2 sx + 3 r 2 sx n 4 3 r 2 x + 4 3 r 2 x n

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 523 3 rs 2 x + 3 rs 2 x n + 6 3 rsx 6 3 rsx n + 3 s 3 x 3 s 3 x n 4 3 s 2 x +4 3 s 2 x n 2 2 r 2 xx n + 2 r 2 x 2 n 2 rsx 2 + 2 2 rsxx n 2 rsx 2 n 4 2 rx 2 + 8 2 rxx n 4 2 rx 2 n 22 s 2 xx n + 2 s 2 x 2 n 4 2 sx 2 + 8 2 sxx n 4 2 sx 2 n + rx3 3rx 2 x n + 3rxx 2 n +sx 3 3sx 2 x n + 3sxxn 2 sx3 n + 6x3 8x 2 x n + 2 s 2 x 2 rxn 3 +8xxn 2 + 2 r 2 x 2 6xn 3 2x4 + 8x 3 x n 2x 2 xn 2 + 8xx3 n 2x4 n ) β 2 (x n x + s)(x n x + r) (20 4 ( 4 r 4 4 r 3 s 2 4 r 3 4 r 2 s 2 (s 2)(r 2)) +3 4 r 2 s 4 rs 3 + 3 4 rs 2 + 4 s 4 2 4 s 3 + 3 r 3 x 3 r 3 x n 3 r 2 sx + 3 r 2 sx n 2 3 r 2 x + 2 3 r 2 x n 3 rs 2 x + 3 rs 2 x n + 3 3 rsx 3 3 rsx n + 3 s 3 x 3 s 3 x n 2 3 s 2 x + 2 3 s 2 x n + 2 r 2 x 2 2 2 r 2 xx n + 2 r 2 x 2 n 2 rsx 2 + 2 2 rsxx n 2 rsx 2 n 22 rx 2 +4 2 rxx n 2 2 rx 2 n 22 s 2 xx n + 2 s 2 x 2 n 22 sx 2 + 4 2 sxx n 2 2 sx 2 n + rx3 3rx 2 x n + 3rxx 2 n +sx 3 3sx 2 x n + 3sxx 2 n sx3 n + 3x3 9x 2 x n + 9xx 2 n 3x3 n 2x 4 + 8x 3 x n + 2 s 2 x 2 rx 3 n 2x2 x 2 n + 8xx3 n 2x4 n ) Equation (5) is evaluated at te non-interpolatig point x n+ and x n+2 wile Equation (6) is evaluated at all points to give te discrete scemes and its derivative. Te discrete sceme and its derivatives are combined i a matrix form as below [ ] A [2] 2 Y M B [2] 2 + 2 2 + 3 (7) A [2] 2 r (r s) (r ) (r s) (r 2) (r s) ((r s)) ((r s)) ((r s)) ((r s)) ((r s)) s (r s) (s ) (r s) (s 2) (r s) ((r s)) ((r s)) ((r s)) ((r s)) ((r s)) 0 0 0 0 0 0,Y M y n+s y n+r y n+ y n+2 y n+s y n+r y n+ y n+2,

524 Raed, Abdalreem and Moammad, Aldalal a ( y n B [2] 2 ), R [] 2 3 0 0 2 3 4 5 6 7 8, 2 ( ) f n, 2 3 4 2 22 23 24 3 32 33 34 4 42 43 44 5 52 53 54 6 62 63 64 7 72 73 74 8 82 83 84 f n+s f n+r f n+ f n+2

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 525 2 20 (r4 r 3 s 6r 3 r 2 s 2 + 9r 2 s + 0r 2 rs 3 + 9rs 2 30rs + s 4 6s 3 + 0s 2 ) 2 2 (r )(s ) (r 4 r 3 s 5r 3 r 2 s 2 + 8r 2 s + 5r 2 rs 3 + 8rs 2 20rs) 22rs + 5r + s 4 5s 3 + 5s 2 + 5s 3) 3 2 (r 2)(s 2) (r 4 r 3 s 4r 3 r 2 s 2 + 7r 2 s + 2r 2 rs 3 + 7rs 2 20rs 4 5 6rs + 4r + s 4 4s 3 + 2s 2 + 4s) 20rs (r5 r 4 s 6r 4 r 3 s 2 + 9r 3 s + 0r 3 r 2 s 3 + 9r 2 s 2 30r 2 s rs 4 + 9rs 3 30rs 2 + s 5 6s 4 + 0s 3 ) 20rs (r5 r 4 s 6r 4 r 3 s 2 + 9r 3 s + 0r 3 r 2 s 3 + 9r 2 s 2 30r 2 s 8rs 5 + 4rs 4 2rs 3 + 30rs 2 8s 6 68s 5 + 9s 4 0s 3 ) 6 20rs (8r6 + 8r 5 s + 68r 5 4r 4 s 9r 4 + r 3 s 2 + 2r 3 s + 0r 3 + r 2 s 3 9r 2 s 2 30r 2 s + rs 4 9rs 3 + 30rs 2 s 5 + 6s 4 0s 3 ) 7 8 2 3 4 20rs (r5 r 4 s 6r 4 r 3 s 2 + 9r 3 s + 0r 3 r 2 s 3 + 9r 2 s 2 30r 2 s rs 4 + 9rs 3 30rs 2 + 50rs 33r + s 5 6s 4 + 0s 3 33s 59) 20rs (r5 r 4 s 6r 4 r 3 s 2 + 9r 3 s + 0r 3 r 2 s 3 + 9r 2 s 2 30r 2 s rs 4 + 9rs 3 30rs 2 + 40rs 576r + s 5 6s 4 + 0s 3 576s 228) ( 2 r (60(r s)(s )(s 2)) (r4 + r 3 s 6r 3 + r 2 s 2 6r 2 s + 0r 2 + rs 3 6rs 2 + 0rs 2s 4 + 9s 3 0s 2 )) ( 2 s (60(r s)(r )(r 2)) (2r4 r 3 s 9r 3 r 2 s 2 + 6r 2 s + 0r 2 rs 3 + 6rs 2 0rs s 4 + 6s 3 0s 2 )) ( 2 rs (60(r )(s )) (r4 r 3 s 4r 3 r 2 s 2 + 6r 2 s rs 3 +6rs 2 + s 4 4s 3 )) ( 2 rs (20(s 2)(r 2)) (r4 r 3 s 2r 3 r 2 s 2 + 3r 2 s rs 3 +3rs 2 + s 4 2s 3 ))

526 Raed, Abdalreem and Moammad, Aldalal a 2 22 ( 2 (r ) (60s(r s)(s 2)) (r4 + r 3 s 5r 3 + r 2 s 2 5r 2 s + 5r 2 + rs 3 5rs 2 + 5rs + 5r 2s 4 + 7s 3 3s 2 3s 3)) ( 2 (s ) (60r(r s)(r 2)) (2r4 r 3 s 7r 3 r 2 s 2 + 5r 2 s + 3r 2 rs 3 +5rs 2 5rs + 3r s 4 + 5s 3 5s 2 5s + 3)) 23 (2 60 (r4 r 3 s 3r 3 r 2 s 2 + 5r 2 s 3r 2 rs 3 + 5rs 2 + 5rs 3r +s 4 3s 3 3s 2 3s + 4)) 24 (2 (s )(r ) (20(r 2)(s 2)) (r4 r 3 s r 3 r 2 s 2 + 2r 2 s r 2 rs 3 +2rs 2 + 2rs r + s 4 s 3 s 2 s + )) D [2] ( 2 (r 2) 2 3 (60s(r s)(s )) (r4 + r 3 s 4r 3 + r 2 s 2 4r 2 s + 2r 2 + rs 3 4rs 2 + 2rs + 4r 2s 4 + 5s 3 )) D [2] ( 2 (s 2) 2 32 (60r(r s)(r )) (2r4 r 3 s 5r 3 r 2 s 2 + 4r 2 s rs 3 + 4rs 2 2rs s 4 + 4s 3 2s 2 4s)) 33 (2 (r 2)(s 2) (60(r )(s )) (r4 r 3 s 2r 3 r 2 s 2 + 4r 2 s 4r 2 rs 3 34 (2 4 42 43 44 +4rs 2 + 8rs 8r + s 4 2s 3 4s 2 8s + 6)) 20 (r4 r 3 s r 2 s 2 + r 2 s rs 3 + rs 2 + 2rs + s 4 8)) (60s(r s)(s )(s 2)) (r5 + r 4 s 6r 4 + r 3 s 2 6r 3 s + 0r 3 +r 2 s 3 6r 2 s 2 + 0r 2 s + rs 4 6rs 3 + 0rs 2 2s 5 + 9s 4 0s 3 )) (60r(r s)(r )(r 2)) (2r5 r 4 s 9r 4 r 3 s 2 + 6r 3 s + 0r 3 r 2 s 3 +6r 2 s 2 0r 2 s rs 4 + 6rs 3 0rs 2 s 5 + 6s 4 0s 3 ) (60(r )(s )) r5 r 4 s 4r 4 r 3 s 2 + 6r 3 s r 2 s 3 + 6r 2 s 2 rs 4 + 6rs 3 + s 5 4s 4 ) (20(s 2)(r 2)) (r5 r 4 s 2r 4 r 3 s 2 + 3r 3 s r 2 s 3 + 3r 2 s 2 rs 4 +3rs 3 + s 5 2s 4 ))

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 527 5 52 53 54 6 62 63 64 7 72 73 (60s(r s)(s )(s 2)) (r5 + r 4 s 6r 4 + r 3 s 2 6r 3 s + 0r 3 + r 2 s 3 6r 2 s 2 + 0r 2 s 8rs 5 4rs 4 + 54rs 3 50rs 2 56s 5 36s 4 + 30s 3 ) (60r(r s)(r )(r 2)) (2r5 r 4 s 9r 4 r 3 s 2 + 6r 3 s + 0r 3 r 2 s 3 +6r 2 s 2 0r 2 s rs 4 + 6rs 3 0rs 2 + 8s 6 + 68s 5 9s 4 + 0s 3 ) (60(r )(s )) (r5 r 4 s 4r 4 r 3 s 2 + 6r 3 s r 2 s 3 + 6r 2 s 2 8rs 5 +4rs 4 4rs 3 8s 6 50s 5 + 6s 4 ) ) (20(s 2)(r 2) (r5 r 4 s 2r 4 r 3 s 2 + 3r 3 s r 2 s 3 + 3r 2 s 2 8rs 5 +4rs 4 7rs 3 8s 6 32s 5 + 3s 4 ) (60s(r s)(s )(s 2)) (8r6 + 68r 5 r 4 s 9r 4 r 3 s 2 + 6r 3 s + 0r 3 r 2 s 3 + 6r 2 s 2 0r 2 s rs 4 + 6rs 3 0rs 2 + 2s 5 9s 4 + 0s 3 ) ) (60r(r s)(r )(r 2)) (8r5 s + 56r 5 + 4r 4 s + 36r 4 r 3 s 2 54r 3 s 30r 3 r 2 s 3 + 6r 2 s 2 + 50r 2 s rs 4 + 6rs 3 0rs 2 s 5 +6s 4 0s 3 ) (60(r )(s )) (8r6 + 8r 5 s + 50r 5 4r 4 s 6r 4 + r 3 s 2 + 4r 3 s +r 2 s 3 6r 2 s 2 + rs 4 6rs 3 s 5 + 4s 4 ) (20(s 2)(r 2)) (8r6 + 8r 5 s + 32r 5 4r 4 s 3r 4 + r 3 s 2 + 7r 3 s +r 2 s 3 3r 2 s 2 + rs 4 3rs 3 s 5 + 2s 4 ) (60s(r s)(s )(s 2)) (r5 + r 4 s 6r 4 + r 3 s 2 6r 3 s + 0r 3 + r 2 s 3 6r 2 s 2 + 0r 2 s + rs 4 6rs 3 + 0rs 2 33r 2s 5 + 9s 4 0s 3 59) (60r(r s)(r )(r 2)) (2r5 r 4 s 9r 4 r 3 s 2 + 6r 3 s + 0r 3 r 2 s 3 +6r 2 s 2 0r 2 s rs 4 + 6rs 3 0rs 2 s 5 + 6s 4 0s 3 + 33s + 59) (60(r )(s )) (r5 r 4 s 4r 4 r 3 s 2 + 6r 3 s r 2 s 3 + 6r 2 s 2 rs 4 +6rs 3 40rs + 7r + s 5 4s 4 + 7s 66)

528 Raed, Abdalreem and Moammad, Aldalal a 74 8 82 83 84 (20(s 2)(r 2)) (r5 r 4 s 2r 4 r 3 s 2 + 3r 3 s r 2 s 3 + 3r 2 s 2 rs 4 +3rs 3 0rs 3r + s 5 2s 4 3s 33) (60s(r s)(s )(s 2)) (r5 + r 4 s 6r 4 + r 3 s 2 6r 3 s + 0r 3 + r 2 s 3 6r 2 s 2 + 0r 2 s + rs 4 6rs 3 + 0rs 2 576r 2s 5 + 9s 4 0s 3 228) (60r(r s)(r )(r 2)) (2r5 r 4 s 9r 4 r 3 s 2 + 6r 3 s + 0r 3 r 2 s 3 +6r 2 s 2 0r 2 s rs 4 + 6rs 3 0rs 2 s 5 + 6s 4 0s 3 + 576s + 228) (60(r )(s )) (r5 r 4 s 4r 4 r 3 s 2 + 6r 3 s r 2 s 3 + 6r 2 s 2 rs 4 +6rs 3 80rs 496r + s 5 4s 4 496s 632) (20(s 2)(r 2)) (r5 r 4 s 2r 4 r 3 s 2 + 3r 3 s r 2 s 3 + 3r 2 s 2 rs 4 +3rs 3 + 40rs 656r + s 5 2s 4 656s 86) Multiplying Equation (7) by te inverse of A [] 2 gives IY m B [ ] [2] 2 + 2 2 + 3 (8) were I is 8 8 identity matrix and B [] 2 s r 2 0 0 0 0, 2 3 4 5 6 7, Ē [] 2 2 3 4 5 6 7 2 22 32 42 52 62 72 3 23 33 43 53 63 73 4 24 34 44 54 64 74 8 8 82 83 84

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 529 wit (2 s 2 (40r 0s 5rs + 2rs 2 + 6s 2 s 3 )) (20r) 2 (2 r 2 (0r 40s + 5rs 2r 2 s 6r 2 + r 3 )) (20s) 3 (2 (35rs 8s 8r + 3)) (20rs) 4 (22 (5rs s r)) (5rs) 5 (s(20s 60r + 30rs 5rs2 + 8rs 3 5s 2 + 69s 3 + 8s 4 )) (20r) 6 (r(20r 60s + 30rs 5r2 s + 8r 3 s 5r 2 + 69r 3 + 8r 4 )) (20s) 7 8 ((50rs 33s 33r 59)) 20rs) ((5rs 72s 72r 266)) (5rs) (2 s 2 (20r 0s 5rs + 3rs 2 + 9s 2 2s 3 )) (60(s )(s 2)(r s)) 2 ( 2 s 4 (s 2 6s + 0)) (60r(r )(r 2)(r s)) 3 (2 s 4 (4s 0r + 2rs s 2 )) (60(r )(s )) 4 (2 s 4 (2s 5r + 2rs s 2 )) (20(r 2)(s 2)) 2 ( 2 r 4 (r 2 6r + 0)) (60s(s )(s 2)(r s)) 22 (2 r 2 (0r 20s + 5rs 3r 2 s 9r 2 + 2r 3 )) (60(r )(r 2)(r s)) 23 (2 r 4 (0s 4r 2rs + r 2 )) (60(s )(r )) 24 (2 r 4 (5s 2r 2rs + r 2 )) (20(s 2)(r 2))

530 Raed, Abdalreem and Moammad, Aldalal a 3 32 ( 2 (8r 3)) (60s(s )(s 2)(r s)) ( 2 (8s 3)) (60r(r )(r 2)(r s)) 33 (2 (5rs 7s 7r + 4)) (60(s )(r )) 34 (2 (5rs 2s 2r + )) (20(s 2)(r 2)) 4 42 (4 2 r) (5s(s )(s 2)(r s)) (4 2 s) (5r(r )(r 2)(r s)) 43 (42 (5rs 4s 4r + 4)) (5(s )(r )) 44 (22 (r + s 2)) (5(s 2)(r 2)) 5 (s(60r 40s 60rs + 5rs2 + 8rs 3 + 45s 2 + 54s 3 )) (60(s )(s 2)(r s)) 52 (s3 (8s 3 + 69s 2 5s + 20)) (60r(r )(r 2)(r s)) 53 (s3 (20r 0s 5rs + 8rs 2 + 5s 2 + 8s 3 )) (60(s )(r )) 54 (s3 (0r 5s 5rs + 8rs 2 + 33s 2 + 8s 3 )) (20(s 2)(r 2)) 6 (r3 (8r 3 + 69r 2 5r + 20)) (60s(s )(s 2)(r s)) 62 (r(60s 40r 60rs + 5r2 s + 8r 3 s + 45r 2 + 54r 3 )) (60(r )(r 2)(r s)) 63 (r3 (20s 0r 5rs + 8r 2 s + 5r 2 + 8r 3 )) (60(s )(r ))

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 53 64 (r3 (0s 5r 5rs + 8r 2 s + 33r 2 + 8r 3 )) (20(s 2)(r 2)) 7 72 73 74 8 82 83 84 ((33r + 59)) (60s(s )(s 2)(r s)) ((33s + 59)) (60r(r )(r 2)(r s)) ((40rs 7s 7r + 66)) (60(s )(r )) ((3r + 3s + 0rs + 33)) (20(s 2)(r 2)) (4(36r + 33)) (5s(s )(s 2)(r s)) (4(36s + 33)) (5r(r )(r 2)(r s)) (4(3r + 3s + 5rs + 02)) (5(s )(r )) ((5rs 82s 82r 02)) (5(s 2)(r 2)) 3. Analysis of te Metod 3.. Order of te Metod Te linear difference operator L associated wit (8) is defined as L[y(x); ] IY M B [ ] [2] 2 2 2 + 3 (9) were y(x) is an arbitrary test function continuously differentiable on [a,b]. Y M and 3 components are expanded in Taylor s series respectively and its terms are collected in powers of to give L[y(x),] C 0 y(x) + C y (x) + C 2 y (x) + (0) Definition 3.. Hybrid block metod (8) and associated linear operator (9) are said to be of order p, ifc 0 C 2 C p+2 0 and C p+2 0 wit error vector constants C p+2.

532 Raed, Abdalreem and Moammad, Aldalal a Expanding (8) in Taylor series about x n gives (s) j j j y n (s)y n (s2 (40r 0s 5rs + 2rs 2 + 6s 2 s 3 )) (20r) j0 (s2 (20r 0s 5rs + 3rs 2 + 9s 2 2s 3 )) (s) j (60(s )(s 2)(r s)) j0 (s 4 (s 2 6s + 0)) (60r(r )(r 2)(r s)) j0 + (s4 (4s 0r + 2rs s 2 )) (r) j (60(r )(s )) j0 j0 j (s4 (2s 5r + 2rs s 2 )) (20(r 2)(s 2)) j0 y n yj n y n ()y n (r2 (0r 40s + 5rs 2r 2 s 6r 2 + r 3 )) (20s) (r 4 (r 2 6r + 0)) (s) j (60s(s )(s 2)(r s)) j0 (r2 (0r 20s + 5rs 3r 2 s 9r 2 + 2r 3 )) (60(r )(r 2)(r s)) j0 (r4 (0s 4r 2rs + r 2 )) (r) j (60(s )(r )) (r4 (5s 2r 2rs + r 2 )) (20(s 2)(r 2)) j0 (r) j j j y n (r)y ((35rs 8s 8r + 3)) n (20rs) j0 (r 4 (r 2 6r + 0)) (s) j (60s(s )(s 2)(r s)) j0 ( 2 (8s 3)) (60r(r )(r 2)(r s)) j0 (2 (5rs 7s 7r + 4)) (r)j (60(s )(r )) j0 (2 (5rs 2s 2r + )) (20(s 2)(r 2)) j0 (2) j j j y n (2)y n (22 (5rs s r)) y n (5rs) j0 (4 2 r) (s) j (5s(s )(s 2)(r s)) j0 (4 2 s) (5r(r )(r 2)(r s)) j0 (42 (5rs 4s 4r + 4)) (r)j (22 (r + s 2)) (5(s )(r )) (5(s 2)(r 2)) j0 j0 y n j0 y n y n y n 0 0 0 0

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 533 By comparing te coefficient of, we obtain te order of te metod to be [5, 5, 5, 5] T wit error constant vector s 4 (70r 28s 42rs + 7rs 2 + 2s 2 4s 3 ) 50400 r 4 (70s 28r 42rs + 7r 2 s + 2r 2 + 46r 3 ) C 7 50400 (56rs 2s 2r + 60) 50400 (7rs + 396) 350 3.2. Zero Stability Te ybrid block metod (8) is said to be zero stable if te first caracteristic polomial π(x) aving roots suc tat x z, and if x z, ten, te multiplicity of x z must not greater tan two. In order to find te zero-stability of main block ˆB [2] 2 [y n+s,y n+r,y n+,y n+2 ] T in (8), we only consider te solution of te first caracteristic polomial were I is 4 4 identity matrix, tat is (r) xi ˆB [2] 2 x x 3 (x ) 0 0 0 0 0 0 0 0 wic implies x 0, 0,,. Hence, our metod is zero stable for all s, r (0, ) 3.3. Consistency Te one step ybrid block metod (8) is said to be consistent if its order greater tan or equal one i.e. P. Tis proves tat our metod is consistent for all s, r (0, ). 3.4. Convergence Teorem 3.2. [Henrici, 962] Consistency and zero stability are sufficient conditions for a linear multistep metod to be convergent. Since te metod is consistent and zero stable, it implies te metod is convergent for all s, r (0, ). 3.5. Numerical Results In finding te accuracy of our metods, te following second order ODEs are examined. Te new block metods solved te same problems te existing metods solved in order to compare results in terms of error.

534 Raed, Abdalreem and Moammad, Aldalal a Table : Comparison of te new metod wit Kayode and Adeyeye (203) for solving Problem, 0 x exact solution computed solution in new metod 0. -0.0570980756477-0.05709930555557 0.2-0.22402758606985-0.2240275555555555 0.3-0.3498588075760038-0.34987534374244883 0.4-0.498246976427035-0.498595056399765 0.5-0.64872270700289-0.64879648045757798 error in our metod, s 4, r 3 errors in [2] 4.229908e 9 8.776e 7 2.60464e 9 3.0356e 6.65367e 9 6.56957e 6 3.480799e 5.4380e 5 7.520976e 5.79656e 5 Table 2: Comparison of te new metod wit Awoyemi et al. (20) for solving problem 2, 320 x exact solution computed solution in new metod s error in our metod,s 3 4, r 3 errors in [3] 4 0..05004729278494.050047293648956 8.640422e 6.5650e 0.2.00335347730753.00335348096378 3.652960e 0 5.4803e 0 0.3.5404359364665.54043680086 8.63749e 0.9256e 9 0.4.202732554054086.2027325556864228.63234e 9 4.8029e 9 0.5.2554288829946.25542846373926 2.754398e 9.0006e 8 Problem 2: y y 0, y(0) 0, y (0), 0.. Exact solution: y(x) e x Problem : y x(y ) 2 0, y(0), y (0) 2, 320. Exact solution: y(x) + ( ) 2 + x 2 ln 2 x 4. Conclusion A two step ybrid block metod wit two generalized off-step points was developed. Te metod was tested to be convergent wit order five for all general off-step point belong to selected interval. Te derived metod was applied to solve bot non-linear and linear second ODEs problems witout converting to te equivalents system of first order ODEs. New generated results confirm te accuracy of te new metods in terms of error.

Two Step Hybrid Block Metod wit Two Generalized Off-step Points 535 References [] S. N. Jator, Solving second order initial value problems by a ybrid multistep metod witout predictors, Applied Matematics and Computation, (200), 27(8), 4036 4046. [2] D. O.Awoyemi, E.A.Adebile, A. O.Adesanya & T.A.Anake, Modified block metod for te direct solution of second order ordinary differential equations, International Journal of Applied Matematics and Computation, (20)., 3(3), 8 88. [3] Kayode, & O. Adeyey, Two-step two-point ybrid metods for general second order differential equations, African Journal of Matematics and Computer Science Researc, (203), 6(0), 9 96. [4] T. A. Anake, D. O. Awoyemi and A. A. Adesanya, A one step metod for te solution of general second order ordinary differential equations, International Journal of science and Tecnology, (202b), 2(4), 59 63. [5] J.D. Lambert, Computational metods in ordinary differential equations, (973). [6] T. A Anake, D. O. Awoyemi and A. A. Adesanya, One-step implicit ybrid block metod for te direct solution of general second order ordinary differential equations, IAENG International Journal of Applied Matematics, (202a), 42(4), 224 228. [7] A. Sagir, An accurate computation of block ybrid metod for solving stiff ordinary differential equations, Journal of Matematics, (202), 4, 8 2. [8] Henrici, P. (962). Discrete variable metods in ordinary differential equations.