Second Derivative Generalized Backward Differentiation Formulae for Solving Stiff Problems
|
|
- Wendy Sims
- 5 years ago
- Views:
Transcription
1 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 Second Derivative Generalized Bacward Differentiation Formulae for Solving Stiff Problems G C Nwachuwu,TOor Abstract Second derivative generalized bacward differentiation formulae (SDGBDF) are developed herein and applied as boundary value methods (BVMs) to solve stiff initial value problems (IVPs) in ordinary differential equations (ODEs) The order, error constant, zero stability and the region of absolute stability for the SDGBDF are discussed The methods are A v, v -stable and v, v -stable with (v,v)-boundary conditions for values of the steplength, v<with order p = + Keywords: Linear Multistep Formulae, Boundary Value Methods, A v, v -stable AMS subject classification: 65L4, 65L5 Introduction The mathematical modeling in science and engineering problems often leads to systems of ordinary differential equations (ODEs) and many of these problems appear to be stiff A potentially good numerical method for the solutionofstiffsystemsofodesmusthavegoodaccuracy and some reasonably wide region of absolute stability, see [3] It is on this ground A-stable (stiffly-stable) methods are required Consider the initial value problem (IVP) y = f(x, y), x [t,t], y(x )=y () Definition (cf: Lambert [37]) The linear system where y = Ay + φ(x), y(a) =η, a x b () y =(y,y,y s ) and η =(η,η,,η s ) is said to be stiff if (i) Re(λ i ) <, i =,,,s (ii)max Re(λ i ) >> Min Re(λ i ) Corresponding Author: Advanced Research Laboratory (AR- LAB), Department of Mathematics, University of Benin, Benin City, Nigeria, gracenwachuwu@unibenedu ARLAB, Department of Mathematics, University of Benin, Benin City, Nigeria, freetega@gmailcom where λ i are the eigenvalues of s s matrix A, and the stiff ratio is Max Re(λi) Min Re(λ i) Definition ([3]) A numerical integrator is said to be A-stable if its region of absolute stability R incorporates the entire left half of the complex plane denoted C, ie, R = {z C Re(z) } (3) Bacward differentiation formulae (BDF) α j y n+j = hf n+ (4) are among the first most popular numerical methods to be proposed for stiff initial value problems (IVPs), see [, 9] These methods are found to be A-stable up to order p = with order p = and A(α) stable for = 3()6 In [9] is introduced a class of extended bacward differentiation formulae (EBDF) α j y n+j = hβ f n+ + hβ + f n++ (5) which has some advantage over the usual BDF It is found to be A-stable for = ()3 and A(α) stable for = 4()8 with order p = + The modified extended bacward differentiation formulae (MEBDF) by [] is { yn+ h(β v )f n+ = α (6) jy n+j + hv f n+ + hβ + f n++ where the choice of v canbedefinedtomaximizeinsome way the region of absolute stability of (6) The MEBDF is A-stable for = ()3 and A(α) stable for =4()8 with order p = + The second derivative extended bacward differentiation formulae (SDEBDF) by [] are of two classes in predictor-corrector pair They are A- stable for = ()3 and A(α) stable for = 4()8 with order p = + and p + 3 for class and p = +3 for class Other authors such as [34, 6, 4, 5] have also presented some modifications of the BDF That of [8] and [9] considered the BDF (4) as boundary value methods (Advance online publication: February 8)
2 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 (BVMs) and obtained the generalized bacward differentiation formulae (GBDF) with better stability properties than the BDF This class of methods is α j y n+j = hf n+v (7) where { + v = for even + for odd It is v, v -stable and A v, v -stable for all with (v, v)-boundary conditions and order p = Asurvey of some BVMs can be found in the literatures [, 3, 4, 5, 6, 7, 33,,,, 3, 4, 3, 4] In this paper second derivative generalized bacward differentiation formulae (SDGBDF) shall be derived This class of methods is an extentionofgbdfproposedby[8]and[9] Themethods developed which are also applied as BVMs in the sense of [8] and [9] have improved order properties compared to the GBDF with respect to the steplength and are suited for the solution of stiff IVPs in ODEs () The paper is organized as follows In section we recall the main facts about BVMs The stability of BVMs is discussed in section 3 Section 4 deals with the second derivative BVMs, the derivation and stability Section 5 is devoted to the computational aspect for the implementation of the proposed class of methods to demonstrate how the class of methods are applied as BVMs Numerical experiments are carried out in section 6 Finally, in section7theconclusionofthepaperisgiven Boundary Value Methods (BVMs) To obtain the numerical solution of () it is usual to use a -step linear multistep formula (LMF), α j y n+j = h β j f n+j (8) where y n denotes the discrete approximation of the solution y(x n ) at x = x n and h = (T t )/N and f n = f(x n,y n ) If and are two integers such that + = then one may impose the conditions for the LMF (8) by fixing the first ( ) values of the discrete solution y,y,,y and the last = values y N +,,y N yielding the discrete problem α i+ y n+i = h β i+ f n+i,n=,,n, i= i= y,y,,y, y N +,,y N fixed (9) In this case the given continuous initial value problem () is approximated by means of a discrete boundary value problem The resulting methods are BVMs with (, )-boundary conditions Observe that for = and therefore =, one has the initial value methods (IVMs) So the class of IVMs is a subclass of BVMs for ODEs based on LMF [7] The continuous problem () provides only the initial value y In the sense of [7], to implement (9) as a BVM, the additional values y,,y, y N +,,y N are obtained by introducing a set of additional equations which are derived by a set of additional initial methods α (j) i y i = h β (j) i f i, j =,, () and final methods α (j) i y N i = h β (j) i f N i, () j = N +,,N The equations (9), () and () form a composite scheme assumed to be of the same order where () and () are the most suitable set of additional methods The discrete problem generated by a -step BVM with (, )- boundary conditions can be put in matrix form as A N y hb N f = (α iy i hβ i f i ) α y hβ f α y N hβ f N i= (α +iy N +i hβ +if N +i ) () where A N and B N are (N +) (N +)matricesgiven in (39) and (4) respectively, y =(y,,y N ) T is the discrete solution, f =(f,,f N ) T and h is the step size The matrix A N qb N,whereq = hλ, has a bloc quasi- Toeplitz structure which is as a result of the additional methods () and () in A N and B N as given in () 3 Stability of BVMs In order to characterize the stability of the family of methods to be considered the definitions of zero-stability and absolute stability for LMM (8) are generalized to BVM by introducing the following two inds of polynomials [6, 8]: Definition 3 Consider a polynomial p(z) such that p is a function of a complex variable z, calculatedbythe formula: p(z) = α j z j = α z +α z ++α (α ) (3) (Advance online publication: February 8)
3 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 The zeros of the polynomial p(z) are denoted by z i,i =,,Ifthezerosz i are simple for all values of i their multiplicities are equal to one The polynomial p(z) is called the Schur polynomial if for all values of i =,, the condition z i < is satisfied The polynomial p(z) is called the Von Neumann polynomial if for all values of i =,, the condition z i is satisfied ([37]) Definition 4 Apolynomialp(z) of degree = + is a S -polynomial if its roots are such that z z z < < z + z and it is a N - polynomial if z z z < z + z being simple the roots of unit modulus Observe that for = and = a N - polynomial reduces to a Von Neumann polynomial and a S -polynomial reduces to a Schur polynomial Let ρ(z) = α jz j and σ(z) = β jz j denote the two characteristic polynomials associated with the LMM (8) Thus (z,q) =ρ(z) qσ(z),q = hλ, is the stability polynomial when (8) is applied on y = λy, Re(λ) < Then we have the following definitions (see [6, 7]): Definition 5 ABVMwith(, )-boundary conditions is O -stable if ρ(z) is a N - polynomial Observe that O -stability reduces to the usual zerostability from Definition 5 for LMM when = and = Definition 6 (a) For a giving q C, abvmwith (, )-boundary conditions is (, )-absolutely stable if (z,q) is a S -polynomial Again, (, )-absolute stability reduces to the usual notion of absolute stability when = and =for LMM (b) Similarly, one defines the region of (, )-absolute stability of the method as D = {q C : (z,q) is a S -pololynomial} Here (z,q) is a polynomial of type (,, ) (c) A BVM with (, )-boundary conditions is said to be A -stable if C D 4 Second Derivative BVMs, Derivation and Stability The second derivative bacward differentiation formulae (SDBDF) are based on the second derivative linear multistep formula (SDLMF) and can be defined generally as: α j y n+j = hβ f n+ + h γ f n+ (4) The conventional SDBDF provides -stable methods up to = 8 and are -unstable for 9withanorder p = + Following the idea of Brugnano and Trigiante [6,7,8,9],werewrite(4)as: α j y n+j = hβ i f n+i + h f n+i (5) where i =() and γ hasbeennormalizedto The choice i = is widely used to derive the conventional SDBDF as IVMs When (5) is used as BVMs with i, we gain the freedom of choosing the values of i which provide methods having the best stability properties for all values of In fact this is the case if i = v such that { + v = for even + (6) for odd Consequently (5) becomes α j y n+j = hβ v f n+v + h f n+v (7) where the + parameters allow the construction of methods of maximal order p = + The class of methods (7) called second derivative generalized bacward differentiation formulae (SDGBDF) must be used as BVMs with (v, v) boundary conditions These methods are found to be v, v -stable and A v, v -stable for all where v is the number of roots inside the unit circle and v are the number of roots outside the unit circle We rewrite the formula (7) as: α j y(x + jh)=hβ v y (x + vh)+h y (x + vh) (8) Expanding (8) in Taylor series and applying the method of undetermined coefficients yields a system of linear equations for the coefficients α j and β v (see [38] and [8]) ThesecoefficientsareinTables7and8for = () According to [37] and [7] the local truncation error associated with (7) is the linear difference operator L[y(x); h] = α jy(x + jh) hβ v y (x + vh) h y (x + vh) (9) Assuming that y(x) is sufficiently differentiable, we can find the Taylor series expansion of the terms in (9) about the point x to obtain the expression where L[y(x); h] = C y(x)+c hy (x)+ + C q h q y (q) (x)+ C = α j, C = jα j + β v,, j= () (Advance online publication: February 8)
4 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 C q = j= j q α j q! We say that (7) has order p if + β vv q (q )! vq (q )! C j =, j =()p and C p+, () see [3] The C p+ is the error constant and C p+ h p+ y p+ (x) is the principle local truncation error at the point x The order equations () is equivalent to α 3 4 α 3 4 v α v = 6v α q 3 q 4 q q qv q β v q(q )v q () The order and the error constant of the SDGBDF (7) are shown in tables 7 and 8 for = () For the numerical solution of () the second derivative BVMs with (, )-boundary conditions, the main method α i+ y n+i = h β i+ f n+i +h λ i+ f n+i, i= i= i= n =,,N y,,y, y N,,y N+ fixed together with additional initial methods α (j) i y i = h β (j) i f i + h j =,, (3) λ (j) i f i, (4) and final methods { α(j) i y N i = h β(j) i f N i +h λ(j) i f N i, j = N,,N + can be expressed as A N y hb N f h C N f = (α iy n+i hβ i f n+i h λ i f n+i ) α y n+ hβ f n+ h λ f n+ α y n+n hβ f n+n h λ f n+n i= (α +iy n+n +i hβ +i f n+n +i h λ +if n+n +i ) (5) (6) where A N and B N are defined similarly as in (), while C N is given in (4), y = (y,,y N ) T is the discrete solution, f and f are the first and second derivatives respectively, h is the step size and A N,B N and C N are (N +) (N + ) matrices with the same structure as those in () To analyze the stability of a specific method (6), (see, [3]) we apply (3) on the test problem y = λy, y = λ y (7) to determine its boundary locus The class of methods (7) yields the characteristics equation: α j z j (qβ v + q )z v =, q = λh, q C (8) where v is defined as in (6) Letting z = e iθ we obtain two roots (since (8) is quadratic in q) for corresponding values of and v to give the stability regions defined by q given in Figures and for odd and even values of respectively Compared with the generalization of the BDF by Brugnano and Trigiante [8] discussed in section the proposed class of methods (7) are found to have higher order p = + and a smaller error constant for corresponding values of the steplength, although with need to compute the second derivative for which it is not expensive for some autonomous stiff systems 5 Implementation Procedure In this section the implementation procedure for the SDGBDF(7) of order 4 and 5 as BVMs in the sense of Brugnano and Trigiante [7, 8] is presented The proposed class of methods (7) is used with the following additional initial methods: αj y j = hβ i f i + h f i, i =,,,v (9) and final methods: αj y j = hβ i f i + h f i, i = v +,,N (3) The SDGBDF (7) of order 4 which is A, -stable and, -stable with (, )-boundary conditions requires two initial methods (y is already provided by the initial value defining the ODE ()) and one final method The fourth order SDGBDF (7) is given as: 6 y n+y n+ 5 y n++ 3 y n+3 = hf n+ +h f n+ (3) Themainmethod(3)canbewrittenintheform 6 y n +y n 5 y n + 3 y n+ = hf n + h f n (3) n =,,N (Advance online publication: February 8)
5 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 and used with the following initial method and final method 3 y 5 y +y 6 y 3 = hf + h f (33) 9 y N 3 3 y N +6y N 85 8 y N = 3 hf N +h f N (34) Similarly the SDGBDF (7) of order 5 { 8 y n y n+ +3y n y n+3 + y n+4 = 5 3 hf n+3 + h f n+3 n =3,,N with the initial methods and (35) y 55 8 y +3y y y 4 = 5 3 hf + h f (36) y y 5 y y 3 y 4 =h f (37) and the final method { 8 y N y N 3 3y N +8y N 45 7 y N = 5 6 hf N + h f N will be taen together as a BVM (38) The methods (3 and 35) are implemented as BVMs efficiently by composing the main methods and the additional methods as simultaneous numerical integrators for the IVP() In particular for linear problems, we can solve () directly from the start with Gaussian elimination partially using pivoting and for nonlinear problems we can use a modified Newton-Raphson method In each case, the main methods and the additional methods are combined as BVMs to give a single matrix of finite difference equations which simultaneously provides the values of the solution and the first derivatives generated by the sequences {y n }, {y n},n =,,N,wherethesingle bloc matrix equation is solved while adjusting for boundary conditions ([35]) 6 Numerical Experiments with SDGBDF We consider the following stiff problems (linear and nonlinear) to illustrate the implementation and examine the accuracy of the SDGBDF (7) of orders p=4 (3) and 5 (35) implemented as bloc methods The fourth order method (7) and the fifth order method (7) are denoted by SDGBDF4 and SDGBDF5 respectively Problem : A linear stiff problem, see [4,, 5, 43] y = y +9y y 3, y () =, y =9y y +y 3, y () =, y 3 =4y 4y +4y 3, y 3 () = The SDGBDF4 is applied to this problem and the maximum absolute errors ( y(x) y n ) in the interval < x < are compared with the Adams type bloc method of Ainfenwa [4] (ATBM7), the generalized bacward differentiation formula of Brugnano and Trigiante [](GBDF8) and the L(α)-stable bloc multistep method of Ehigie and Ounuga [5] denoted by EH- OK5 The rate of convergence, Rate h = log ( errh err h ) where err h is the maximum absolute error at steplength h = n,n=,,, 3 and 4, is used to verify the order ofthemethods AlsoincomparisonwiththeCBDF 5 of degree s = 5 in Ramos and Garcia-Rubio [43], the AbsErr(t f ) is obtained by the SDGBDF4 in the interval x It is observed that the new method even though it is of order 4 performs better than the EH-OK5, theatbm7andthegbdf8oforders5,7and8respectively The details of the numerical results are displayed in Table In Table, it is noticed that the SDGBDF4 is comparable with the EH-OK5 in [5] and the CBDF 5 in [43] Table : Maximum absolute error, Max <i<n y i (x) y i,n for problem, h = n n SDGBDF4 EH-OK5 GBDF8 ATBM7 (Rate) (Rate) (Rate) (Rate) (387) (499) (64) (78) (393) (499) (7) (76) (44) (5) (664) (836) (64) (5) (684) (795) Table : Numerical results in comparison with CBDF 5 and EH-OK5 for problem the interval x Steps SDGBDF4 EH-OK5 CBDF 5 (Rate) (Rate) (Rate) (4) (496) (495) (397) (543) (495) (493) (453) (75) Problem : Non-linear stiff system solved by Wu and Xia [44] y = y + y, y () =, y = y y ( + y ), y () =, (Advance online publication: February 8)
6 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 The exact solution of the system is given by y (x) =e x, y (x) =e x Problem is solved using SDGBDF5 with a steplength h =8 in the range x The maximum error (Max y i y(x i ) ) of the method is given in Table 3 From Table 3, it is obvious that the new method of order 5 is better than the methods of Ehigie et al [4] and Wu- Xia [44] and very comparable with the method of Jator and Sahi [36] which are of orders 5, 6 and 8 respectively Problem 3: Singularly Perturbed Problem Table 3: Maximum error, Max y i y(x i ), for problem Method N h y y (Max y i y(x i ) ) (Max y i y(x i ) ) SDGBDF Ehigie et al (BVM3) Jator-Sahi Wu-Xia y = ( + 4 )y + 4 y, y = y y y, y () =, y () = The exact solution is y = e t, y = e t, see [3] The SDGBDF4 and the SDGBDF5 are applied to Problem 3 and the results are compared with the theoretical solution The SDGBDF5 performs better than the SDGBDF4 as expected, see Table 4 Furthermore, tae note that the graphs of the exact and the numerical solutions in Figures 3 and 4 coincide Table 4: Absolute error in problem 3, h =, Error y i = y i y(x i ), i =, x y i Error in SDGBDF4 Error in SDGBDF5 y y y y y y y y y y y y y y y y y y y y Problem 4: Van der Pol equations, see [3] (nonlinear problem) y = y, y = y +y ( y ), y () =, y () = For problem 4, it is clearly seen from Table 5 and Figures 5 and 6 that the proposed class of methods compares favorably with the solution from the Ode5s in MATLAB Problem 5: Robertson s equation, see [3] (nonlinear Table 5: Errors in problem 4 using the modulus of the solution of SDGBDF minus the solution of Ode5s, h = Error y i = y isdgbdf y iode5s, i =, x y i Error in SDGBDF4 Error in SDGBDF5 y y y y y y y y y y problem) y = 4y + 4 y y 3, y =4y 4 y y y, y 3 =3 7 y, y () =, y () =, y 3 () = Problem 5 is solved by the SDGBDF4 and the SDGBDF5 and the results are compared with the solution from the Ode5s in MATLAB It is observed from Table 6 and Figures 7 and 8 that the new methods are very comparable with the Ode5s in MATLAB Table 6: Errors in problem 5 using the modulus of the solution of SDGBDF minus the solution of Ode5s, h = Error y i = y isdgbdf y iode5s, i =,, 3 x y i Error in SDGBDF4 Error in SDGBDF5 y y y y y y y y y y y y y y y (Advance online publication: February 8)
7 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 Table 7: The Coefficients, Error Constant (EC) and Order p of SDGBDF(8) for =() v α α α α 3 α 4 α 5 α Table 8: Table 7 continued v α 7 α 8 α 9 α β v γ v EC p A N = α () α () α () α () 3 α () α ( ) α ( ) α ( ) α ( ) 3 α ( ) α α α α 3 α α α α α α α α (N α +) α (N +) α (N) α (N) (39) (Advance online publication: February 8)
8 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 B N = β () β () β () β () 3 β () β ( ) β ( ) β ( ) β ( ) 3 β ( ) β β β β 3 β β β β β β β β β (N +) β (N +) β (N) β (N) (4) C N = λ () λ () λ () λ () 3 λ () λ ( ) λ ( ) λ ( ) λ ( ) 3 λ ( ) λ λ λ λ 3 λ λ λ λ λ λ λ β λ (N) λ (N) λ (N+ ) λ (N+ ) (4) (Advance online publication: February 8)
9 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 Figure : Stability region (exterior of closed curves) of (7), = () 3 (Advance online publication: February 8)
10 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 Figure : Stability region (exterior of closed curves) of (7), = () 3 (Advance online publication: February 8)
11 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 Figure 3: Numerical Results for Problem 3 with SDGBDF4, h= Figure 4: Numerical Results for Problem 3 with SDGBDF5, h= (Advance online publication: February 8)
12 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 Figure 5: Numerical Results for Problem 4 with SDGBDF4, h= Figure 6: Numerical Results for Problem 4 with SDGBDF5, h= (Advance online publication: February 8)
13 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 Figure 7: Numerical Results for Problem 5 with SDGBDF4, h= Figure 8: Numerical Results for Problem 5 with SDGBDF5, h= (Advance online publication: February 8)
14 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 7 Conclusion The second derivative generalized bacward differentiation formulae (SDGBDF) have been introduced in section (4) This class of methods is A v, v -stable and v, v - stable with (v, -v)-boundary conditions for values of withorderp = + The new class of methods is found to be suitable for the solution of stiff IVPs in ODEs for reason of their stability The class of methods (7) also finds application in the solution of boundary value problems, see [35, 39] Acnowledgement The authors are grateful to Prof MNO Ihile (Director of ARLAB) and the anonymous reviewers for comments that have improved the quality of this wor References [] L Aceto, P Ghelardoni and C Magherini, Boundary Value Methods as an extension of Numerovs method for Sturm-Liouville eigenvalue estimates, Appl Numer Math, 59, (9), [] L Aceto and C Magherini, On the relations between BVMs and Runge-utta collocation methods, Journal of Computational and Applied Mathematics, 3, (9), -3 [3] L Aceto, P Ghelardoni and C Magherini, PGSCM: A family of P-stable Boundary Value Methods for second-order initial value problems, Journal of Computational and Applied Mathematics, 36, (), [4] O A Ainfenwa, Seven step Adams Type Bloc Method with Continuous Coefficient for Periodic Ordinary Differential Equation, Word Academy of Science, Engineering and Technology, 74, (), [5] B I Ainnuawe, O A Ainfenwa and S A Ounuga, L-Stable Bloc Bacward Differentiation Formula for Parabolic Partial Differential Equations, Ain Shams Engineering Journal, 7, (6), [6] L Brugnano and D Trigiante, Convergence and stability of boundary value methods for ordinary differential equations, Journal of Computational and Applied Mathematics, 66, (996), 97-9 [7] L Brugnano, Boundary Value Methods for the Numerical Approximation of Ordinary Differential Equations, Lecture Notes in Comput Sci, 96, (997), [8] L Brugnano and D Trigiante, Solving Differential Problems by Multistep Initial and Boundary Value Methods, Gordon and Breach Science Publishers, Amsterdam, 998a [9] L Brugnano and D Trigiante, Boundary Value Methods: the third way between linear multistep and Runge-Kutta methods, Comput Math Appl, 36, (-), (998b), [] L Brugnano and D Trigiante, Bloc Implicit methods for ODEs in: D Trigiante (Ed), Recent trends in Numerical Analysis, New Yor: Nova Science Publ inc, [] L Brugnano and C Magherini, Blended Implicit Methods for solving ODE and DAE problems and their extension for second order problems, Jour Comput Appl Mathematics, 5, (7), [] L Brugnano, F Iavernaro and T Susca, Hamiltonian BVMs (HBVMs): implementation details and applications, AIP Conf Proc, 68, (9), [3] L Brugnano, F Iavernaro and D Trigiante, Hamiltonian BVMs (HBVMs): a family of drift-free methods for integrating polynomial Hamiltonian systems, AIP Conf Proc, 68, (9), [4] L Brugnano, F Iavernaro and D Trigiante, Hamiltonian boundary value methods (Energy preserving discrete line integral methods), Journal of Numerical Analysis, Industrial and Applied Mathematics, 5, -, (), 7-37 [5] L Brugnano, F Iavernaro and D Trigiante, A note on the efficient implementation of Hamiltonian BVMs Journal of computational and Applied Mathematics, 36, (), [6] L Brugnano, G Frasca Caccia and F Iavernaro, Efficient implementation of Gauss collocation and Hamiltonian Boundary Value Methods Numer Algor, 65, (4), [7] L Brugnano, F Iavernaro and D Trigiante, Analisys of Hamiltonian Boundary Value Methods (HB- VMs): a class of energy preserving Runge-Kutta methods for the numerical solution of polynomial Hamiltonian systems, Communications in Nonlinear Science and Numerical Simulation,, 3, (5), [8] R L Burden and J D Faires, Numerical Analysis (9th Edition), Broos/Cole, Cengage Learning, Boston, [9] J R Cash, On integration of stiff systems of ordinary differential equations using extended bacward differentiation formula, Numer Math, 3, (98), [] J R Cash, Second Derivative Extended Bacward Differentiation Formulas for the Numerical Integration of Stiff Systems, SIAM Journal of Numerical Analysis, 8(), (98), -36 (Advance online publication: February 8)
15 IAENG International Journal of Applied Mathematics, 48:, IJAM_48 [] J R Cash, The Integration of Stiff initial value problems in ODEs using modified extended bacward differentiation formula, Comput Math Appl, 9, (983), [] C F Curtis and J O Hirschfelder, Integration of Stiff Equations, National Academy of Sciences, 38, (95), [3] G Dahlquist, A special stability problem for linear multistep methods, BIT, 3, (963), 7-43 [4] JO Ehigie, SN Jator, AB Sofoluwe and SA Ounuga, Boundary value technique for initial value problems with continuous second derivative multistep method of Enright, Computational and Applied Mathematics, 33(), (4), 8-93 [5] JO Ehigie and SA Ounuga, L(α)-stable second derivative bloc multistep formula for stiff initial value problems, IAENG International journal of Applied Mathematics, 44(3), (4), 57-6 [6] A K Ezzeddine and G Hojjati, Hybrid Extended Bacward Differentiation Formulas for Stiff Systems, International Journal of Nonlinear Science, (), (), 96-4 [7] S O Fatunla, Bloc methods for second order IVPs, Intern J Compt Maths, 4, (99), [8] V G Ganzha and E V Vorozhtsov, Computer- Aided Analysis of Difference Schemes for Partial Differential Equations, John Wiley and Sons, Inc, Canada, 996 [9] C W Gear, Numerical initial value problems in ordinary differential equations, Prentice-Hall, New Jersey, (97), 53pp [3] E Hairer and G Wanner, Solving Ordinary Differential Equations II: Stiff and Differential Algebraic Problems, Second Revised Edition, Springer Verlag, Germany, 996 [3] P Henrici, Discrete Variable Methods in Ordinary Differential Equations, Wiley, New Yor, 96 [3] F Iavernaro and F Mazzia, Bloc-Boundary Value Methods for the solution of Ordinary Differential Equations, SIAM J Sci Comput, (), (999), [35] S N Jator and J Li, Boundary Value Methods via a Multistep Method with Variable Coefficients for Second order initial and boundary value problems, International Journal of Pure and Applied Mathematics, 5(3), (9), 43-4 [36] S N Jator and RK Sahi, Boundary value technique for initial value problems based on Adamstype second derivative methods, International Journal of Mathematical Education in Science and Technology, 4(6), (), [37] J D Lambert, Numerical methods for ordinary differential equations, John Wiley and Sons, New Yor, 99 [38] J R LeVeque, Finite Difference Methods for Ordinary and Partial Differential Equations, SIAM, 7 [39] ZA Majid, MM Hasni and N Senu, Solving Second Order Linear Dirichlet and Neumann Boundary Value Problems by Bloc Method, IAENG International Journal of Applied Mathematics, 43(), (3), 7-76 [4] F Mazzia, Boundary Value Methods for the numerical solution of Boundary Value Problems in Differential-Algebraic Equations, Bollettino dellunione Matematica Italiana, (7) -A, (997), [4] F Mazzia and I Sgura, Numerical approximation of nonlinear BVPs by means of BVMs, Appl Numer Math, 4 (), [4] H Musa, A -Point Variable Step Size Bloc Extended Bacward Differentiation Formula for Solving Stiff IVPs, Nigerian Association of Mathematical Physics, 8(), (4), 93- [43] H Ramos and R Garcia-Rubio, Analysis of a Chebyshev-based Bacward Differentiation Formulae and Relation with Runge-utta Collocation Methods, International Journal of Computer Mathematics, 88, 3, (), [44] X Wu and J Xia, Two low accuracy methods for stiff systems, Appl Math Comput, 3, (), 4-53 [33] F Iavernaro and B Pace, Conservative Bloc- Boundary Value Methods for the Solution of Polynomial Hamiltonian Systems, AIP Conf Proc, 48, (8), [34] Z B Ibrahim, K I Othman and M Suleiman, Variable Step Bloc Bacward Differentiation Formula for Solving First Order Stiff Odes, World Congress on Engineering, (7), (Advance online publication: February 8)
-Stable Second Derivative Block Multistep Formula for Stiff Initial Value Problems
IAENG International Journal of Applied Mathematics, :3, IJAM 3_7 -Stable Second Derivative Bloc Multistep Formula for Stiff Initial Value Problems (Advance online publication: 3 August ) IAENG International
More informationA Family of L(α) stable Block Methods for Stiff Ordinary Differential Equations
American Journal of Computational and Applied Mathematics 214, 4(1): 24-31 DOI: 1.5923/.acam.21441.4 A Family of L(α) stable Bloc Methods for Stiff Ordinary Differential Equations Aie I. J. 1,*, Ihile
More informationA Family of Block Methods Derived from TOM and BDF Pairs for Stiff Ordinary Differential Equations
American Journal of Mathematics and Statistics 214, 4(2): 121-13 DOI: 1.5923/j.ajms.21442.8 A Family of Bloc Methods Derived from TOM and BDF Ajie I. J. 1,*, Ihile M. N. O. 2, Onumanyi P. 1 1 National
More informationSixth-Order and Fourth-Order Hybrid Boundary Value Methods for Systems of Boundary Value Problems
Sith-Order and Fourth-Order Hybrid Boundary Value Methods for Systems of Boundary Value Problems GRACE O. AKILABI Department of Mathematics Covenant University, Canaanland, Ota, Ogun State IGERIA grace.akinlabi@covenantuniversity.edu.ng
More informationA CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS FOR STIFF IVPs IN ODEs
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LVIII, 0, f. A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS FOR STIFF IVPs IN ODEs BY R.I. OKUONGHAE Abstract.
More information369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 2017 pp
369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 27 pp. 369-374 Original Research Article THIRD DERIVATIVE MULTISTEP METHODS WITH OPTIMIZED REGIONS OF ABSOLUTE STABILITY FOR
More informationA Zero-Stable Block Method for the Solution of Third Order Ordinary Differential Equations.
A Zero-Stable Block Method for the Solution of Third Order Ordinary Differential Equations. K. Rauf, Ph.D. 1 ; S.A. Aniki (Ph.D. in view) 2* ; S. Ibrahim (Ph.D. in view) 2 ; and J.O. Omolehin, Ph.D. 3
More informationUniform Order Legendre Approach for Continuous Hybrid Block Methods for the Solution of First Order Ordinary Differential Equations
IOSR Journal of Mathematics (IOSR-JM) e-issn: 8-58, p-issn: 319-65X. Volume 11, Issue 1 Ver. IV (Jan - Feb. 015), PP 09-14 www.iosrjournals.org Uniform Order Legendre Approach for Continuous Hybrid Block
More informationImplicit Second Derivative Hybrid Linear Multistep Method with Nested Predictors for Ordinary Differential Equations
American Scientiic Research Journal or Engineering, Technolog, and Sciences (ASRJETS) ISSN (Print) -44, ISSN (Online) -44 Global Societ o Scientiic Research and Researchers http://asretsournal.org/ Implicit
More informationOne-Step Hybrid Block Method with One Generalized Off-Step Points for Direct Solution of Second Order Ordinary Differential Equations
Applied Mathematical Sciences, Vol. 10, 2016, no. 29, 142-142 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6127 One-Step Hybrid Block Method with One Generalized Off-Step Points for
More informationZ. Omar. Department of Mathematics School of Quantitative Sciences College of Art and Sciences Univeristi Utara Malaysia, Malaysia. Ra ft.
International Journal of Mathematical Analysis Vol. 9, 015, no. 46, 57-7 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijma.015.57181 Developing a Single Step Hybrid Block Method with Generalized
More informationContinuous Block Hybrid-Predictor-Corrector method for the solution of y = f (x, y, y )
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
More informationA Class of an Implicit Stage-two Rational Runge-Kutta Method for Solution of Ordinary Differential Equations
Journal of Applied Mathematics & Bioinformatics, vol.2, no.3, 2012, 17-31 ISSN: 1792-6602 (print), 1792-6939 (online) Scienpress Ltd, 2012 A Class of an Implicit Stage-two Rational Runge-Kutta Method for
More informationResearch Article Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations
International Mathematics and Mathematical Sciences Volume 212, Article ID 767328, 8 pages doi:1.1155/212/767328 Research Article Diagonally Implicit Block Backward Differentiation Formulas for Solving
More informationA New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations
A New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations Rei-Wei Song and Ming-Gong Lee* d09440@chu.edu.tw, mglee@chu.edu.tw * Department of Applied Mathematics/
More informationConstruction and Implementation of Optimal 8 Step Linear Multistep
Page 138 ORIGINAL RESEARCH Construction and Implementation of Optimal 8 Step Linear Multistep method Bakre Omolara Fatimah, Awe Gbemisola Sikirat and Akanbi Moses Adebowale Department of Mathematics, Lagos
More informationA NOTE ON EXPLICIT THREE-DERIVATIVE RUNGE-KUTTA METHODS (ThDRK)
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 303-4874 (p), ISSN (o) 303-4955 www.imvibl.org / JOURNALS / BULLETIN Vol. 5(015), 65-7 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationAdebayo O. Adeniran1, Saheed O. Akindeinde2 and Babatunde S. Ogundare2 * Contents. 1. Introduction
Malaya Journal of Matematik Vol. No. 73-73 8 https://doi.org/.37/mjm/ An accurate five-step trigonometrically-fitted numerical scheme for approximating solutions of second order ordinary differential equations
More informationBlock Algorithm for General Third Order Ordinary Differential Equation
ICASTOR Journal of Mathematical Sciences Vol. 7, No. 2 (2013) 127-136 Block Algorithm for General Third Order Ordinary Differential Equation T. A. Anake 1, A. O. Adesanya 2, G. J. Oghonyon 1 & M.C. Agarana
More informationExtended Runge Kutta-like formulae
Applied Numerical Mathematics 56 006 584 605 www.elsevier.com/locate/apnum Extended Runge Kutta-like formulae Xinyuan Wu a Jianlin Xia b a State Key Laboratory for Novel Software Technology Department
More informationCONVERGENCE PROPERTIES OF THE MODIFIED NUMEROV RELATED BLOCK METHODS
Vol 4 No 1 January 213 CONVERGENCE PROPERTIES OF THE MODIFIED NUMEROV RELATED BLOCK METHODS YS, Awari 1 and AA, Abada 2 1 Department of Mathematics & 2 Department of Statistics, BinghamUniversity, Karu,
More informationHigh-order symmetric schemes for the energy conservation of polynomial Hamiltonian problems.
High-order symmetric schemes for the energy conservation of polynomial Hamiltonian problems. Felice Iavernaro and Donato Trigiante Abstract We define a class of arbitrary high order symmetric one-step
More informationModified block method for the direct solution of second order ordinary differential equations
c Copyright, Darbose International Journal of Applied Mathematics and Computation Volume 3(3),pp 181 188, 2011 http://ijamc.psit.in Modified block method for the direct solution of second order ordinary
More informationTHE CONVERGENCE AND ORDER OF THE 3-POINT BLOCK EXTENDED BACKWARD DIFFERENTIATION FORMULA
VOL 7 NO DEEMBER ISSN 89-668 6- Asian Research Publishing Networ (ARPN) All rights reserved wwwarpnournalscom THE ONVERGENE AND ORDER OF THE -POINT BLOK EXTENDED BAKWARD DIFFERENTIATION FORMULA H Musa
More informationResearch Article An Accurate Block Hybrid Collocation Method for Third Order Ordinary Differential Equations
Applied Mathematics, Article ID 549597, 9 pages http://dx.doi.org/1.1155/14/549597 Research Article An Accurate Bloc Hybrid Collocation Method for Third Order Ordinary Differential Equations Lee Ken Yap,
More informationOn Nonlinear Methods for Stiff and Singular First Order Initial Value Problems
Nonlinear Analysis and Differential Equations, Vol. 6, 08, no., 5-64 HIKARI Ltd, www.m-hikari.com https://doi.org/0.988/nade.08.8 On Nonlinear Methods for Stiff and Singular First Order Initial Value Problems
More informationBlended implementation of block implicit methods for ODEs
Applied Numerical Mathematics 42 (2002) 29 45 www.elsevier.com/locate/apnum Blended implementation of block implicit methods for ODEs Luigi Brugnano, Cecilia Magherini Dipartimento di Matematica U. Dini,
More informationOrdinary differential equations - Initial value problems
Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter
More informationHigh-order Symmetric Schemes for the Energy Conservation of Polynomial Hamiltonian Problems 1 2
European Society of Computational Methods in Sciences and Engineering (ESCMSE) Journal of Numerical Analysis, Industrial and Applied Mathematics (JNAIAM) vol 4, no -2, 29, pp 87- ISSN 79 84 High-order
More informationMathematics for chemical engineers. Numerical solution of ordinary differential equations
Mathematics for chemical engineers Drahoslava Janovská Numerical solution of ordinary differential equations Initial value problem Winter Semester 2015-2016 Outline 1 Introduction 2 One step methods Euler
More informationExponentially Fitted Error Correction Methods for Solving Initial Value Problems
KYUNGPOOK Math. J. 52(2012), 167-177 http://dx.doi.org/10.5666/kmj.2012.52.2.167 Exponentially Fitted Error Correction Methods for Solving Initial Value Problems Sangdong Kim and Philsu Kim Department
More informationFour Point Gauss Quadrature Runge Kuta Method Of Order 8 For Ordinary Differential Equations
International journal of scientific and technical research in engineering (IJSTRE) www.ijstre.com Volume Issue ǁ July 206. Four Point Gauss Quadrature Runge Kuta Method Of Order 8 For Ordinary Differential
More informationResearch Article P-Stable Higher Derivative Methods with Minimal Phase-Lag for Solving Second Order Differential Equations
Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2011, Article ID 407151, 15 pages doi:10.1155/2011/407151 Research Article P-Stable Higher Derivative Methods with Minimal Phase-Lag
More informationThe Milne error estimator for stiff problems
13 R. Tshelametse / SAJPAM. Volume 4 (2009) 13-28 The Milne error estimator for stiff problems Ronald Tshelametse Department of Mathematics University of Botswana Private Bag 0022 Gaborone, Botswana. E-mail
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Linear Multistep methods Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the
More informationSolution of First Order Initial Value Problem by Sixth Order Predictor Corrector Method
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 6 (2017), pp. 2277 2290 Research India Publications http://www.ripublication.com/gjpam.htm Solution of First Order Initial
More informationA NEW INTEGRATOR FOR SPECIAL THIRD ORDER DIFFERENTIAL EQUATIONS WITH APPLICATION TO THIN FILM FLOW PROBLEM
Indian J. Pure Appl. Math., 491): 151-167, March 218 c Indian National Science Academy DOI: 1.17/s13226-18-259-6 A NEW INTEGRATOR FOR SPECIAL THIRD ORDER DIFFERENTIAL EQUATIONS WITH APPLICATION TO THIN
More informationFourth Order RK-Method
Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)
More informationApplied Numerical Analysis
Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory
More informationEfficient numerical methods for the solution of stiff initial-value problems and differential algebraic equations
10.1098/rspa.2003.1130 R EVIEW PAPER Efficient numerical methods for the solution of stiff initial-value problems and differential algebraic equations By J. R. Cash Department of Mathematics, Imperial
More informationRunge Kutta Collocation Method for the Solution of First Order Ordinary Differential Equations
Nonlinear Analysis and Differential Equations, Vol. 4, 2016, no. 1, 17-26 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/nade.2016.5823 Runge Kutta Collocation Method for the Solution of First
More informationarxiv: v1 [math.na] 31 Oct 2016
RKFD Methods - a short review Maciej Jaromin November, 206 arxiv:60.09739v [math.na] 3 Oct 206 Abstract In this paper, a recently published method [Hussain, Ismail, Senua, Solving directly special fourthorder
More informationEnergy-Preserving Runge-Kutta methods
Energy-Preserving Runge-Kutta methods Fasma Diele, Brigida Pace Istituto per le Applicazioni del Calcolo M. Picone, CNR, Via Amendola 122, 70126 Bari, Italy f.diele@ba.iac.cnr.it b.pace@ba.iac.cnr.it SDS2010,
More informationTHREE- AND FOUR-DERIVATIVE HERMITE BIRKHOFF OBRECHKOFF SOLVERS FOR STIFF ODE
THREE- AND FOUR-DERIVATIVE HERMITE BIRKHOFF OBRECHKOFF SOLVERS FOR STIFF ODE By Njwd Albishi February 2016 A Thesis submitted to the Faculty of Graduate and Postdoctoral Studies in partial fulfillment
More informationApplied Math for Engineers
Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method
More informationA FAMILY OF EXPONENTIALLY FITTED MULTIDERIVATIVE METHOD FOR STIFF DIFFERENTIAL EQUATIONS
A FAMILY OF EXPONENTIALLY FITTED MULTIDERIVATIVE METHOD FOR STIFF DIFFERENTIAL EQUATIONS ABSTRACT. ABHULIMENC.E * AND UKPEBOR L.A Department Of Mathematics, Ambrose Alli University, Ekpoma, Nigeria. In
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Multistep Methods Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 1. Runge Kutta methods 2. Embedded RK methods
More information4 Stability analysis of finite-difference methods for ODEs
MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture
More informationA family of A-stable Runge Kutta collocation methods of higher order for initial-value problems
IMA Journal of Numerical Analysis Advance Access published January 3, 2007 IMA Journal of Numerical Analysis Pageof20 doi:0.093/imanum/drl00 A family of A-stable Runge Kutta collocation methods of higher
More informationCS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationJim Lambers MAT 772 Fall Semester Lecture 21 Notes
Jim Lambers MAT 772 Fall Semester 21-11 Lecture 21 Notes These notes correspond to Sections 12.6, 12.7 and 12.8 in the text. Multistep Methods All of the numerical methods that we have developed for solving
More informationReview Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester
HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE
More informationECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations
ECE257 Numerical Methods and Scientific Computing Ordinary Differential Equations Today s s class: Stiffness Multistep Methods Stiff Equations Stiffness occurs in a problem where two or more independent
More informationHybrid Methods for Solving Differential Equations
Hybrid Methods for Solving Differential Equations Nicola Oprea, Petru Maior University of Tg.Mureş, Romania Abstract This paper presents and discusses a framework for introducing hybrid methods share with
More informationGeneralized RK Integrators for Solving Ordinary Differential Equations: A Survey & Comparison Study
Global Journal of Pure and Applied Mathematics. ISSN 7-78 Volume, Number 7 (7), pp. Research India Publications http://www.ripublication.com/gjpam.htm Generalized RK Integrators for Solving Ordinary Differential
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationNumerical Differential Equations: IVP
Chapter 11 Numerical Differential Equations: IVP **** 4/16/13 EC (Incomplete) 11.1 Initial Value Problem for Ordinary Differential Equations We consider the problem of numerically solving a differential
More informationBOLLETTINO UNIONE MATEMATICA ITALIANA
BOLLETTINO UNIONE MATEMATICA ITALIANA Lidia Aceto Some applications of the Pascal matrix to the study of numerical methods for differential equations Bollettino dell Unione Matematica Italiana, Serie 8,
More informationCHAPTER 5: Linear Multistep Methods
CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order
More informationChapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2.
Chapter 5 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rjl/fdmbook Exercise 5. (Uniqueness for
More informationOn the stability regions of implicit linear multistep methods
On the stability regions of implicit linear multistep methods arxiv:1404.6934v1 [math.na] 8 Apr 014 Lajos Lóczi April 9, 014 Abstract If we apply the accepted definition to determine the stability region
More informationInitial-Value Problems for ODEs. Introduction to Linear Multistep Methods
Initial-Value Problems for ODEs Introduction to Linear Multistep Methods Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University
More informationHIGH ORDER VARIABLE MESH EXPONENTIAL FINITE DIFFERENCE METHOD FOR THE NUMERICAL SOLUTION OF THE TWO POINTS BOUNDARY VALUE PROBLEMS
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org /JOURNALS / JOURNAL Vol. 8(2018), 19-33 DOI: 10.7251/JMVI1801019P Former BULLETIN OF THE
More informationMath 128A Spring 2003 Week 12 Solutions
Math 128A Spring 2003 Week 12 Solutions Burden & Faires 5.9: 1b, 2b, 3, 5, 6, 7 Burden & Faires 5.10: 4, 5, 8 Burden & Faires 5.11: 1c, 2, 5, 6, 8 Burden & Faires 5.9. Higher-Order Equations and Systems
More informationOne Step Continuous Hybrid Block Method for the Solution of
ISSN 4-86 (Paper) ISSN -9 (Online) Vol.4 No. 4 One Step Continuous Hybrid Block Method for the Solution of y = f ( x y y y ). K. M. Fasasi * A. O. Adesanya S. O. Adee Department of Mathematics Modibbo
More informationSolving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations
Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations Outline ODEs and initial conditions. Explicit and implicit Euler methods. Runge-Kutta methods. Multistep
More informationLecture 6. Numerical Solution of Differential Equations B21/B1. Lecture 6. Lecture 6. Initial value problem. Initial value problem
Lecture 6 Numerical Solution of Differential Equations B2/B Initial value problem y = f(x,y), x [x,x M ] y(x ) = y Professor Endre Süli Numerical Solution of Differential Equations p./45 Numerical Solution
More informationCHAPTER 10: Numerical Methods for DAEs
CHAPTER 10: Numerical Methods for DAEs Numerical approaches for the solution of DAEs divide roughly into two classes: 1. direct discretization 2. reformulation (index reduction) plus discretization Direct
More informationIndex. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems
Index A-conjugate directions, 83 A-stability, 171 A( )-stability, 171 absolute error, 243 absolute stability, 149 for systems of equations, 154 absorbing boundary conditions, 228 Adams Bashforth methods,
More informationNumerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
More informationSemi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations
Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Sunyoung Bu University of North Carolina Department of Mathematics CB # 325, Chapel Hill USA agatha@email.unc.edu Jingfang
More informationAN OVERVIEW. Numerical Methods for ODE Initial Value Problems. 1. One-step methods (Taylor series, Runge-Kutta)
AN OVERVIEW Numerical Methods for ODE Initial Value Problems 1. One-step methods (Taylor series, Runge-Kutta) 2. Multistep methods (Predictor-Corrector, Adams methods) Both of these types of methods are
More informationMath 660 Lecture 4: FDM for evolutionary equations: ODE solvers
Math 660 Lecture 4: FDM for evolutionary equations: ODE solvers Consider the ODE u (t) = f(t, u(t)), u(0) = u 0, where u could be a vector valued function. Any ODE can be reduced to a first order system,
More information9.6 Predictor-Corrector Methods
SEC. 9.6 PREDICTOR-CORRECTOR METHODS 505 Adams-Bashforth-Moulton Method 9.6 Predictor-Corrector Methods The methods of Euler, Heun, Taylor, and Runge-Kutta are called single-step methods because they use
More informationEfficient implementation of Radau collocation methods
Efficient implementation of Radau collocation methods Luigi Brugnano Felice Iavernaro Cecilia Magherini arxiv:1302.1037v1 [math.na] 5 Feb 2013 December 29, 2012 Abstract In this paper we define an efficient
More informationPredictor Corrector Methods of High Order for Numerical Integration of Initial Value Problems
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 2, February 2016, PP 47-55 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Predictor
More informationTwo Step Hybrid Block Method with Two Generalized Off-step Points for Solving Second Ordinary Order Differential Equations Directly
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
More informationPart IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationInitial value problems for ordinary differential equations
Initial value problems for ordinary differential equations Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 IVP
More informationAug Vol. 5. No. 03 International Journal of Engineering and Applied Sciences EAAS & ARF. All rights reserved
FORMULATION OF PREDICTOR-CORRECTOR METHODS FROM 2-STEP HYBRID ADAMS METHODS FOR THE SOLUTION OF INITIAL VALUE PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS 1 ABUBAKAR M. BAKOJI, 2 ALI M. BUKAR, 3 MUKTAR
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationThe family of Runge Kutta methods with two intermediate evaluations is defined by
AM 205: lecture 13 Last time: Numerical solution of ordinary differential equations Today: Additional ODE methods, boundary value problems Thursday s lecture will be given by Thomas Fai Assignment 3 will
More informationNumerical integration of DAE s
Numerical integration of DAE s seminar Sandra Allaart-Bruin sbruin@win.tue.nl seminar p.1 Seminar overview February 18 Arie Verhoeven Introduction to DAE s seminar p.2 Seminar overview February 18 Arie
More informationSouthern Methodist University.
Title: Continuous extensions Name: Lawrence F. Shampine 1, Laurent O. Jay 2 Affil./Addr. 1: Department of Mathematics Southern Methodist University Dallas, TX 75275 USA Phone: +1 (972) 690-8439 E-mail:
More informationBlock Milne s Implementation For Solving Fourth Order Ordinary Differential Equations
Engineering Technology & Applied Science Research Vol 8 No 3 2018 2943-2948 2943 Block Milne s Implementation For Solving Fourth Order Ordinary Differential Equations J G Oghonyon Department of Mathematics
More informationScientific Computing with Case Studies SIAM Press, Lecture Notes for Unit V Solution of
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 1 Dianne P. O Leary c 2008 1 The
More informationIntroduction to the Numerical Solution of IVP for ODE
Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that
More informationOn the Computational Procedure of Solving Boundary Value Problems of Class M Using the Power Series Method
Australian Journal of Basic and Applied Sciences, 4(6): 1007-1014, 2010 ISSN 1991-8178 On the Computational Procedure of Solving Boundary Value Problems of Class M Using the Power Series Method 1 2 E.A.
More informationResearch Article A Family of Trigonometrically Fitted Enright Second Derivative Methods for Stiff and Oscillatory Initial Value Problems
Journal of Applied Mathematics Volume 2015, Article ID 343295, 17 pages http://dx.doi.org/10.1155/2015/343295 Research Article A Family of Trigonometrically Fitted Enright Second Derivative Methods for
More informationA definition of stiffness for initial value problems for ODEs SciCADE 2011, University of Toronto, hosted by the Fields Institute, Toronto, Canada
for initial value problems for ODEs SciCADE 2011, University of Toronto, hosted by the Fields Institute, Toronto, Canada Laurent O. Jay Joint work with Manuel Calvo (University of Zaragoza, Spain) Dedicated
More informationStability Ordinates of Adams Predictor-Corrector Methods
BIT manuscript No. will be inserted by the editor) Stability Ordinates of Adams Predictor-Corrector Methods Michelle L. Ghrist Bengt Fornberg Jonah A. Reeger Received: date / Accepted: date Abstract How
More information8.1 Introduction. Consider the initial value problem (IVP):
8.1 Introduction Consider the initial value problem (IVP): y dy dt = f(t, y), y(t 0)=y 0, t 0 t T. Geometrically: solutions are a one parameter family of curves y = y(t) in(t, y)-plane. Assume solution
More informationNumerical Integration of Equations of Motion
GraSMech course 2009-2010 Computer-aided analysis of rigid and flexible multibody systems Numerical Integration of Equations of Motion Prof. Olivier Verlinden (FPMs) Olivier.Verlinden@fpms.ac.be Prof.
More informationTHE θ-methods IN THE NUMERICAL SOLUTION OF DELAY DIFFERENTIAL EQUATIONS. Karel J. in t Hout, Marc N. Spijker Leiden, The Netherlands
THE θ-methods IN THE NUMERICAL SOLUTION OF DELAY DIFFERENTIAL EQUATIONS Karel J. in t Hout, Marc N. Spijker Leiden, The Netherlands 1. Introduction This paper deals with initial value problems for delay
More informationBackward error analysis
Backward error analysis Brynjulf Owren July 28, 2015 Introduction. The main source for these notes is the monograph by Hairer, Lubich and Wanner [2]. Consider ODEs in R d of the form ẏ = f(y), y(0) = y
More informationCAM Ph.D. Qualifying Exam in Numerical Analysis CONTENTS
CAM Ph.D. Qualifying Exam in Numerical Analysis CONTENTS Preliminaries Round-off errors and computer arithmetic, algorithms and convergence Solutions of Equations in One Variable Bisection method, fixed-point
More informationSolving Ordinary Differential Equations
Solving Ordinary Differential Equations Sanzheng Qiao Department of Computing and Software McMaster University March, 2014 Outline 1 Initial Value Problem Euler s Method Runge-Kutta Methods Multistep Methods
More informationNew Third Order Runge Kutta Based on Contraharmonic Mean for Stiff Problems
Applied Mathematical Sciences, Vol., 2009, no. 8, 65-76 New Third Order Runge Kutta Based on Contraharmonic Mean for Stiff Problems Osama Yusuf Ababneh 1 and Rokiah Rozita School of Mathematical Sciences
More informationMath Numerical Analysis Homework #4 Due End of term. y = 2y t 3y2 t 3, 1 t 2, y(1) = 1. n=(b-a)/h+1; % the number of steps we need to take
Math 32 - Numerical Analysis Homework #4 Due End of term Note: In the following y i is approximation of y(t i ) and f i is f(t i,y i ).. Consider the initial value problem, y = 2y t 3y2 t 3, t 2, y() =.
More informationA New Embedded Phase-Fitted Modified Runge-Kutta Method for the Numerical Solution of Oscillatory Problems
Applied Mathematical Sciences, Vol. 1, 16, no. 44, 157-178 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.1988/ams.16.64146 A New Embedded Phase-Fitted Modified Runge-Kutta Method for the Numerical Solution
More information