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

Transcription

1 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. In this paper, we present a class of continuous hybrid linear multistep methods (CHLMM) for stiff initial value problems (IVPs) in ordinary differential equations (ODEs). The constuction of these methods are based on the approach of collocation and interpolation. The interval of absolute stability of the method is investigated, using the root locus method. Numerical results of the methods solving stiff IVPs in ODEs are compared with that from the state-of-the-art Ode5s Matlab ODEs code. Mathematics Subject Classification 000: 65L05, 65L06. Key words: continuous hybrid linear multistep methods, collocation and interpolation, initial value problem, stiff stability, root locus.. Introduction Consider the numerical solution of stiff IVPs () y = f(x, y), y(x 0 ) = y 0, a x b by a class of continuous hybrid LMM (CHLMM) () (3) k y(x n +(t + )h)= α j (t)y n+j +α v (t)y n+v +hβ v (t)f(x n+v, y n+v ), t [, k ], 0 v k k y(x n + vh) = αj(t )y n+j + hβk (t )f n+k, v = t +, t = k 3,

2 40 R.I. OKUONGHAE where y n+j is the numerical approximation to the exact solution y(x n+j ), f n+j = f(x n+j, y n+j ), {α j (t), j = 0()k }, α v (t), {αj (t ), j = 0()k}, β v (t), and βk (t), are continuous coefficients in t presumed to be real and satisfying the normalization condition α k (t) =, αv(t ) =, x = x n+ +th, t [a, b] and h = x n+ x n is a fixed mesh size. The problem of stiffness in most ordinary differential equations (ODEs) has posed a lot of computational difficulties in many practical application modeled by ODEs. Stiffness affects the efficiency of numerical methods. Here, we present a class of continuous Hybrid linear multistep methods for stiff IVPs in ODEs. Hybrid LMM was first proposed by []. Other authors are, [,, 3, 4, 6, 9, 0,, 3, 4, 6, 9, 0,, ]. In fact, the numerical solution of () by () through collocation and interpolation methods have been well studied in the literature, see for example [3], [5], [5], [7, 8], [6], [6], [4], and [7, 8]. The interval of absolute stability of the CHLMM is investigated using the root locus method discussed in [0, ] and [3], whose application can be found in [6] and [4] instead of the equivalent boundary locus plot in [7] and [9]. The local truncation error for () and (3) are nicely given as (4) (5) k L.T.E = [y(x n + (t + )h) α j (t)y(x n + jh) α v (t)y( n +vh) hβ v (t)y (x n + vh)] and k L.T.E = [y(x n + vh) αj(t )y(x n + jh) hβk (t )y (x n + kh)]. The order for () and the expression for y n+v in the function f n+v in () are p = k+ and p = k+ respectively. Effective implementation of () demand the use of the Newton iterative scheme y [s+] n+k s = 0,,,..., where, F (y [s] = y[s] n+k F (y [s] n+k ) F (y [s] n+k ), n+k ) is the Jacobian matrix of the vector systems of the method. In particular, for k step the nonlinear equation F (y [s] n+k ) = 0. The parameter v is incorporated to provide off step collocation point x n+v in an open interval (x n+k, x n+k ) and v = k, where k is the step number of the scheme. Formula () is zero stable for fixed step size, h case for k 7. For k 8, no stable process appear to exist. See the root locus plots of the methods in section 4. The motivation to derive the hybrid method () is the fact that, it offers the means to by pass the Dahlquist

3 3 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 4 order barrier for A-stable conventional LMM and the fact that continuous solution of the IVPs in ODEs can be obtained. The proposed continuous hybrid LMM in () consists of the addition of terms α v (t)y n+v to the left hand side of the One-leg hybrid LMM in [9] k α jy n+j = hβ v f(x n+v, y n+v ). Implementation of () required us to compute first y n+v in (3) so that the terms y n+v and f n+v in () could be evaluated. Considerations as to how this might be done appear in section 5 in this paper. The Outline of this paper is as follows. We start with the construction of the continuous hybrid LMM in () of k + in section. Section 3 deals with the derivations of the continuous hybrid predictor y n+v in the function f n+v of the method in (3). In section 4, we determined the stiff stability of the methods, using the root locus. Finally, in section 5, result of numerical experiments on some stiff test systems are presented and compared with Ode5s code from MATLAB ODE suite in [5].. Derivation of the continuous hybrid linear multistep methods The solution of the IVPs in () is assumed to be the polynomial k+ (6) y(x) = a j x j where {a j } k+ (8) we have are the real parameter constants to be determined. From k+ (7) y (x) = f(x, y) = ja j x j Collocating (7) at x = x n+v and interpolating (9) at x = x n+j, j = 0()k and x = x n+v, we obtain the linear system of equations (8) j= x n x n... x k+ n x n+ x n+... x k+ n x n+k x n+k... x k+ n+k x n+v x n+v... x k+ n+v 0 x n+v... (k + )x k n+v a 0 a. a k a k a k+ = y n y n+. y n+k y n+v f n+v.

4 4 R.I. OKUONGHAE 4 Solving equation (8) for a js and substituting the resulting values into (6) with t = (x x n+ )/h and setting x = x t+ on the left hand side of (6) yield the values of the continuous coefficients {α j } k (t), α v(t), β v (t) respectively. Fixing t = k into the continuous coefficients {α j } k (t), α v (t), β v (t) for a fixed k, give the values of the discrete coefficients of the method in () for k 7. For example, see Table in appendix A for the continuous coefficients for method () for k 7. Table. in appendix A shows explicitly the discrete coefficients for method () for k The derivation of the continuous hybrid predictor Similarly, the corresponding hybrid predictor (9) y(x n + vh) = k αj(t)y n+j + hβk (t)f n+k, v = t +, t = k 3/ for y(x n+v ), and f(x n+v ) in () are obtained from the polynomial interpolant k+ (0) y(x n+v ) = b j x j. where {b} k+ are the real parameter constants to be determined. Following the same procedure in section, the unknown continuous coefficients of the hybrid predictors in () are obtained. After some simplifications, we obtained a class of continuous hybrid predictors from (). Table 3 in appendix B below shows the continuous coefficients of the predictor (3) for k 7. Table 4. in appendix B gives the discrete coefficients for the predictor (3) for k Stability of the methods by plotting the root locus In this section, we investigate the stability properties of the family of the continuous hybrid linear multistep method (CHLMM) in () using the root locus plot discussed in [0, ]. On substituting the hybrid solution (3) y n+v at point x n+v into the continuous hybrid LMM for a fixed k and t, and applying the resultant method on the scalar test problem y = λy, Re(λ) < 0, we obtain the continuous hybrid LMM stability polynomials to

5 5 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 43 be k k k π(r, z) = r k α j r j α v ( αjr j + zβk rk ) zβ v ( αjr j + zβk rk ), () z = λh. Plotting r j (z) against z reveals the interval of absolute stability for the methods. The general form of the stability plot is given below in figure. Method () is said to be stable respectively, if 0 r j (z) where, r j (z), j = 0()k are roots of the polynomial in () with root r j (z) = been simple. Plotting the root locus of π(r, z) = 0, it is observed that the methods in () are stiffly stable for k 7. The graphs in figures -9 below show the loci and thus the interval of absolute/stiff stability of each method for a fixed value of k 7. The case of k 8 are stiffly unstable, see figure 9 and Table 4.3 respectively. r j Region of Absolute Instability Region of Absolute Instability - Z Region of Absolute Instability 0 Region of Absolute Instability Z Region of Absolute Instability Region of Absolute stability Figure : The root locus form of the region of absolute stability/stiff stability. See [0]

6 44 R.I. OKUONGHAE 6 Root Locus Plots for the Continuous Hybrid Multistep Methods in () r j r j Figure : Root Locus Plot for k Figure 3: Root Locus Plot for k r j r j Figure 4: Root Locus Plot for k 3 r j Figure 5: Root Locus Plot for k 4 r j Figure 6: Root Locus Plot for k 5 r j Figure 7: Root Locus Plot for k 6 r j Figure 8: Root Locus Plot for k Figure 9*: Root Locus Plot for k 8

7 7 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 45 Table 4.: The continuous and discrete error constants of method(). k t Continuous Error Constant (Cp+(t)) Cp+ 0 4 ( + t)( + t) h 3 y (3) 4 96 t( 3t + 4t3 )h 4 y (4) (3 t) t( + t )h 5 y (5) (5 t) t( + t)( + t)t( + t)h 6 y (6) (7 t) ( 3 + t)( + t)( + t)t( + t)h 7 y (7) (9 t) ( 4 + t)( 3 + t)( + t)( + t)t( + t)h 8 y (8) ( t) ( 5 + t)( 4 + t)( 3 + t)( + t)( + t)t( + t)h 9 y (9) (3 t) ( 6 + t)( 5 + t)( 4 + t)( 3 + t)( + t)( + t)t( + t)h 0 y (0) Table 4.: The continuous and discrete error constants of predictor(3). k t Continuous Error Constant (Cp+(t )) C p t ( + t)h 3 y (3) 48 4 ( + t) t( + t)h 4 y (4) 8 0 ( + t) t( + t )h 5 y (5) 70 ( 3 + t) ( + t)( + t)t( + t)h 6 y (6) ( 4 + t) ( 3 + t)( + t)( + t)t( + t)h 7 y (7) ( 5 + t) ( 4 + t)( 3 + t)( + t)( + t)t( + t)h 8 y (8) ( 6 + t) ( 5 + t)( 4 + t)( 3 + t)( + t)( + t)t( + t)h 9 y (9) ( 7 + t) ( 6 + t)( 5 + t)( 4 + t)( 3 + t)( + t)( + t)t( + t)h 0 y (0) where, Cp+ and C p+ in Table 4. and Table 4. implies Discrete Error Constants for the CHLMM () and Hybrid Predictor (3) respectively.

8 46 R.I. OKUONGHAE 8 Table 4.3: The step-number, scaled variable t and interval of absolute stability of z for the method in () and (3). k t Interval of Absolute Stability of z Order() Order(3) for CHLMM ()+ Predictor(3) 0 (, 0) (4, ) (, 0) (6, ) (, 0) (7.46, ) (, 0) (8.667, ) (, 0) (9.7, ) (, 0) (0., ) (, 0) (.46, ) Unstable 9 9 Table 4.4: The step-number, the range of t for which the CHLMM () and predictor (3) is zero-stable. k The range of t for which the CHLMM ()+ Predictor(3) is zero stable {t : tε[, ]} {t : tε(,.85) (,.6) (.78, )} 3 {t : tε(,.53) (0,.55) (.6, )} 4 {t : tε(,.9) (, 3.43) (3.545, )} 5 {t : tε(,.5075) (0, ) (.9,.46) (, ) (4.504, )} 6 {t : tε(, 0) (0., ) (.6, )} 7 {t : tε(0,.0) (, 3) (3.35, 3.83) (4, 6.96) (6.4569, )} 8 Unstable

9 9 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS Numerical experiments In this section the implementation of the CHLMM in () discussed in sections and 3 of this paper on the stiff initial value problems will be considered. Problem : Linear problem in [7] y = y, y(0) =, y(x) = Problem : Nonlinear chemical problem in [7] and [5] y = 400y y y y, y 3 = y, y(0) = 0 0 e 0.x e 0x e 00x e 000x y = 0.04y y y 3, with x being the range [0,0] for problem [] and h = for problem [], x 0(0.000)3. In solving the initial value problems above, set up the continuous form of the methods from the continuous coefficients table of interest, CHLMM in () for k = is () y(x n +(t+)h) = (+4t+4t )y n +( 4t 4t )y n+ +h(+3t+t )f n+ from table () in Appendix A. The local truncation error and the order for (4) is (3) C 3 (t) = ( + t)( + t) h 3 y (3) (x), p =. 4 Setting t = 0 in (4) gives the equivalent discrete form of the CHLMM in () to be (4) y n+ = y n + hf n+, p =

10 48 R.I. OKUONGHAE 0 Similarly, from table (3) in Appendix B, we obtained the equivalent discrete form of the continuous hybrid predictor in (3) for k = and t = respectively to be (5) y n+ = 4 y n y n+ h 4 f n+, p = It has been noted by [7], [9], [, 3], and [0], that linear multistep methods suitable for stiff ODEs must be implicit and must therefore require a scheme to resolve the implicitness of the methods. Applying discrete methods () and (3) respectively to the initial value problem above leads to solving implicit set of equations which demands the use of Newton Raphson iterative scheme, (6) y [s+] n+k = y[s] n+k F (y [s] n+k ) F (y [s] n+k ), s = 0,,,... where F (y [s] n+k ) is the Jacobian matrix of the vector systems of the method. In particular, for k = the nonlinear equation F (y [s] n+k ) = 0, where (7) F (y [s] n+ ) = y[s] n+ y n hf ( x n+, y [s] ) = 0 n+ (8) y [s] n+ = 4 y n y(x[s] n+ ) h 4 f(x n+, y [s] n+ ). In this regard y [0] n+ is given from the trapezoidal rule (9) y [0] n+ = y n + h (f n+ + f n ), s = 0,,,... as an initial guess for y n+ in (9). Let L be the Lispschitz constant of f(x, y) with respect to y. For non-stiff problems, where L is small, the step size is usually determined by accuracy conditions. However, for stiff problems where L is large, the step size is severely restricted by stability constraint. Terminations of the iteration (6) occur whenever we observe that y [s+] n+ y[s] n+ TOL, where TOL is the order of the unit round off error of the computer, which may be assumed by the user. However figure

11 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 49 Numerical Solution of Prob []. Numerical Solution of Prob [] 0.8 y (x) x x Numerical Solution of Prob []. Numerical Solution of Prob [] CHLMM Ode5s 0.8 y 4 (x) x x [h] Figure 0: The plot of numerical solutions of Problem and Ode5s in [5]. 4 x 0 5 Numerical Solutions CHLMM Ode5s y (x) x Figure : The plot of numerical solutions of y (x) of Problem. 0 and figure below show the plot of the numerical results of the methods when applied to the linear problem and nonlinear problem. Finally, in this paper, we have derived a class of continuous hybrid linear multistep methods () which is of order p = k+, and stiffly stable for k 7 using collocation and interpolation process. The root locus plot in figure 9 revealed that the instability of the methods in () set in when k 8. The numerical solution graphs in figure 0 and figure, of the methods in (4) and (5) coincide and show that the methods in () is compared with the state-of the-art of MATLAB ode5s code in [5], on Problem and Problem respectively.

12 50 R.I. OKUONGHAE Appendix A

13 3 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 5

14 5 R.I. OKUONGHAE 4

15 5 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 53

16 54 R.I. OKUONGHAE 6 Appendix B

17 7 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 55

18 56 R.I. OKUONGHAE 8

19 9 A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS 57 REFERENCES. Butcher, J.C. A modified multistep method for the numerical integration of ordinary differential equations, J. Assoc. Comput. Mach., (965), Butcher, J.C. A generalization of singly-implicit methods, BIT, (98), Butcher, J.C. The Numerical Analysis of Ordinary Differential Equations. Runge- Kutta and General Linear Methods, A Wiley-Interscience Publication, John Wiley & Sons, Ltd., Chichester, Butcher, J.C. Some new hybrid methods for initial value problems. Computational ordinary differential equations (London, 989), 9 46, Inst. Math. Appl. Conf. Ser. New Ser., 39, Oxford Univ. Press, New York, Coleman, J.P.; Duxbury, S.C. Mixed collocation methods for y = f(x, y), J. Comput. Appl. Math., 6 (000), Dahlquist, G. On stability and error analysis for stiff nonlinear problems, Part, Report No TRITA-NA-7508, Dept. of Information processing, Computer Science, Royal Inst. of Technology, Stockholm, Enright, W.H. Second derivative multistep methods for stiff ordinary differential equations, SIAM J. Numer. Anal., (974), Enright, W.H. Continuous numerical methods for ODEs with defect control, Numerical analysis 000, Vol. VI, Ordinary differential equations and integral equations, J. Comput. Appl. Math., 5 (000), Fatunla, S.O. Numerical Methods for Initial Value Problems in Ordinary Differential Equations, Computer Science and Scientific Computing, Academic Press, Inc., Boston, MA, Fatunla, S.O. One leg multistep method for second order differential equation, Comput. Math. Appl., 0 (984), 4.. Forrington, C.V.D. Extensions of the predictor-corrector method for the solution of systems of ordinary differential equations, Comput. J., 4 (96), Gear, C.W. The automatic integration of stiff ordinary differential equations, pp in A.J.H. Morrell (ed). Information processing 68: Proc. IFIP Congress, Edinurgh (968), Nort-Holland, Amsterdam. 3. Gear, C.W. The automatic integration of ordinary differential equations, Comm. ACM, 4 (97), Gragg, W.B.; Stetter, H.J. Generalized multistep predictor-corrector methods, J. Assoc. Comput. Mach., (964),

20 58 R.I. OKUONGHAE 0 5. Higham, D.J.; Higham, N.J. MATLAB Guide, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, Ikhile, M.N.O.; Okuonghae, R.I. Stiffly stable continuous extension of second derivative LMM with an off-step point for IVPs in ODEs, J. Nig. Assoc. Math. Physics., (007), Ikhile, M.N.O. Coefficients for studying one-step rational schemes for IVPs in ODEs. III. Extrapolation methods, Comput. Math. Appl., 47 (004), Ikhile, M.N.O. The root and Bell s disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I. Correction methods, Comput. Math. Appl., 56 (008), Kohfeld, J.J.; Thompson, G.T. Multistep methods with modified predictors and correctors, J. Assoc. Comput. Mach., 4 (967), Lambert, J.D. Numerical Methods for Ordinary Differential Systems. The Initial Value Problem, John Wiley & Sons, Ltd., Chichester, 99.. Lambert, J.D. Computational Methods in Ordinary Differential Equations. Introductory Mathematics for Scientists and Engineers, John Wiley & Sons, London-New York-Sydney, Nevanlinna, O. On the numerical integration of nonlinear initial value problems by linear multistep methods, Nordisk Tidskr. Informationsbehandling (BIT), 7 (977), Owren, B.; Zennaro, M. Continuous explicit Runge-Kutta methods, Computational ordinary differential equations (London, 989), 97 05, Inst. Math. Appl. Conf. Ser. New Ser., 39, Oxford Univ. Press, New York, Okuonghae, R.I. Stiffly Stable Second Derivative Continuous LMM for IVPs in ODEs, Ph.D Thesis, Dept. of Maths. University of Benin, Nigeria, Arévalo, C.; Führer, C.; Selva, M. A collocation formulation of multistep methods for variable step-size extensions, Ninth Seminar on Numerical Solution of Differential and Differential-Algebraic Equations (Halle, 000). Appl. Numer. Math., 4 (00), Sirisena, U.W.; Onumanyi, P.; Chollon, J.P. Continuous hybrid through multistep collocation, ABACUS, 8 (00), Received: 7.I.00 Department of Mathematics, University of Agriculture, Abeokuta, NIGERIA okunoghae0@yahoo.co.uk