A CLASS OF CONTINUOUS HYBRID LINEAR MULTISTEP METHODS FOR STIFF IVPs IN ODEs
|
|
- Anthony Anderson
- 5 years ago
- Views:
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
Implicit 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 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 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 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 information-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 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 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 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 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 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 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 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 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 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 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 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 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 informationLinear Multistep Methods
Linear Multistep Methods Linear Multistep Methods (LMM) A LMM has the form α j x i+j = h β j f i+j, α k = 1 i 0 for the approximate solution of the IVP x = f (t, x), x(a) = x a. We approximate x(t) on
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 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 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 informationSecond Derivative Generalized Backward Differentiation Formulae for Solving Stiff Problems
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
More informationON THE IMPLEMENTATION OF SINGLY IMPLICIT RUNGE-KUTTA METHODS
MATHEMATICS OF COMPUTATION VOLUME 57, NUMBER 196 OCTOBER 1991, PAGES 663-672 ON THE IMPLEMENTATION OF SINGLY IMPLICIT RUNGE-KUTTA METHODS G. J. COOPER Abstract. A modified Newton method is often used to
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 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 informationNUMERICAL METHODS FOR ENGINEERING APPLICATION
NUMERICAL METHODS FOR ENGINEERING APPLICATION Second Edition JOEL H. FERZIGER A Wiley-Interscience Publication JOHN WILEY & SONS, INC. New York / Chichester / Weinheim / Brisbane / Singapore / Toronto
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 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 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 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 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 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 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 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 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 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 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 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 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 informationModule 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction
Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction 1 Introduction In this module, we develop solution techniques for numerically solving ordinary
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 informationNUMERICAL SOLUTION OF ODE IVPs. Overview
NUMERICAL SOLUTION OF ODE IVPs 1 Quick review of direction fields Overview 2 A reminder about and 3 Important test: Is the ODE initial value problem? 4 Fundamental concepts: Euler s Method 5 Fundamental
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 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 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 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 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 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 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 informationORBIT 14 The propagator. A. Milani et al. Dipmat, Pisa, Italy
ORBIT 14 The propagator A. Milani et al. Dipmat, Pisa, Italy Orbit 14 Propagator manual 1 Contents 1 Propagator - Interpolator 2 1.1 Propagation and interpolation............................ 2 1.1.1 Introduction..................................
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 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 informationQuadratic SDIRK pair for treating chemical reaction problems.
Quadratic SDIRK pair for treating chemical reaction problems. Ch. Tsitouras TEI of Chalkis, Dept. of Applied Sciences, GR 34400 Psahna, Greece. I. Th. Famelis TEI of Athens, Dept. of Mathematics, GR 12210
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 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 informationSolving Delay Differential Equations (DDEs) using Nakashima s 2 Stages 4 th Order Pseudo-Runge-Kutta Method
World Applied Sciences Journal (Special Issue of Applied Math): 8-86, 3 ISSN 88-495; IDOSI Publications, 3 DOI:.589/idosi.wasj.3..am.43 Solving Delay Differential Equations (DDEs) using Naashima s Stages
More information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
740 Chapter 16. Integration of Ordinary Differential Equations 16.7 Multistep, Multivalue, and Predictor-Corrector Methods The terms multistepand multivaluedescribe two different ways of implementing essentially
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 information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
16.7 Multistep, Multivalue, and Predictor-Corrector Methods 747 } free_vector(ysav,1,nv); free_vector(yerr,1,nv); free_vector(x,1,kmaxx); free_vector(err,1,kmaxx); free_matrix(dfdy,1,nv,1,nv); free_vector(dfdx,1,nv);
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 informationThe Derivation of Interpolants for Nonlinear Two-Point Boundary Value Problems
European Society of Computational Methods in Sciences and Engineering ESCMSE) Journal of Numerical Analysis, Industrial and Applied Mathematics JNAIAM) vol. 1, no. 1, 2006, pp. 49-58 ISSN 1790 8140 The
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 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 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 information5.6 Multistep Methods
5.6 Multistep Methods 1 Motivation: Consider IVP: yy = ff(tt, yy), aa tt bb, yy(aa) = αα. To compute solution at tt ii+1, approximate solutions at mesh points tt 0, tt 1, tt 2, tt ii are already obtained.
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 informationNumerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.
Numerical Methods for Engineers An Introduction with and Scientists Applications using MATLAB Third Edition Amos Gilat Vish- Subramaniam Department of Mechanical Engineering The Ohio State University Wiley
More informationNumerical solution of ODEs
Numerical solution of ODEs Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology November 5 2007 Problem and solution strategy We want to find an approximation
More informationCS520: numerical ODEs (Ch.2)
.. CS520: numerical ODEs (Ch.2) Uri Ascher Department of Computer Science University of British Columbia ascher@cs.ubc.ca people.cs.ubc.ca/ ascher/520.html Uri Ascher (UBC) CPSC 520: ODEs (Ch. 2) Fall
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 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 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 informationmultistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):
MATH 351 Fall 217 multistep methods http://www.phys.uconn.edu/ rozman/courses/m351_17f/ Last modified: November 28, 217 Recall that we are interested in the numerical solution of the initial value problem
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 informationStudy the Numerical Methods for Solving System of Equation
Study the Numerical Methods for Solving System of Equation Ravi Kumar 1, Mr. Raj Kumar Duhan 2 1 M. Tech. (M.E), 4 th Semester, UIET MDU Rohtak 2 Assistant Professor, Dept. of Mechanical Engg., UIET MDU
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 informationNumerical Solution of ODE IVPs
L.G. de Pillis and A.E. Radunskaya July 30, 2002 This work was supported in part by a grant from the W.M. Keck Foundation 0-0 NUMERICAL SOLUTION OF ODE IVPs Overview 1. Quick review of direction fields.
More information2 Numerical Methods for Initial Value Problems
Numerical Analysis of Differential Equations 44 2 Numerical Methods for Initial Value Problems Contents 2.1 Some Simple Methods 2.2 One-Step Methods Definition and Properties 2.3 Runge-Kutta-Methods 2.4
More informationA Study on Linear and Nonlinear Stiff Problems. Using Single-Term Haar Wavelet Series Technique
Int. Journal of Math. Analysis, Vol. 7, 3, no. 53, 65-636 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.988/ijma.3.3894 A Study on Linear and Nonlinear Stiff Problems Using Single-Term Haar Wavelet Series
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 informationInitial value problems for ordinary differential equations
AMSC/CMSC 660 Scientific Computing I Fall 2008 UNIT 5: Numerical Solution of Ordinary Differential Equations Part 1 Dianne P. O Leary c 2008 The Plan Initial value problems (ivps) for ordinary differential
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 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 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 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 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 informationSolving scalar IVP s : Runge-Kutta Methods
Solving scalar IVP s : Runge-Kutta Methods Josh Engwer Texas Tech University March 7, NOTATION: h step size x n xt) t n+ t + h x n+ xt n+ ) xt + h) dx = ft, x) SCALAR IVP ASSUMED THROUGHOUT: dt xt ) =
More informationON IDEAL AMENABILITY IN BANACH ALGEBRAS
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LVI, 2010, f.2 DOI: 10.2478/v10157-010-0019-3 ON IDEAL AMENABILITY IN BANACH ALGEBRAS BY O.T. MEWOMO Abstract. We prove
More informationOrdinary Differential Equations
CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things
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 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 informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More informationNumerical Analysis. A Comprehensive Introduction. H. R. Schwarz University of Zürich Switzerland. with a contribution by
Numerical Analysis A Comprehensive Introduction H. R. Schwarz University of Zürich Switzerland with a contribution by J. Waldvogel Swiss Federal Institute of Technology, Zürich JOHN WILEY & SONS Chichester
More informationOrdinary Differential Equations
Ordinary Differential Equations Professor Dr. E F Toro Laboratory of Applied Mathematics University of Trento, Italy eleuterio.toro@unitn.it http://www.ing.unitn.it/toro September 19, 2014 1 / 55 Motivation
More informationSolving Ordinary Differential equations
Solving Ordinary Differential equations Taylor methods can be used to build explicit methods with higher order of convergence than Euler s method. The main difficult of these methods is the computation
More informationButcher tableau Can summarize an s + 1 stage Runge Kutta method using a triangular grid of coefficients
AM 205: lecture 13 Last time: ODE convergence and stability, Runge Kutta methods Today: the Butcher tableau, multi-step methods, boundary value problems Butcher tableau Can summarize an s + 1 stage Runge
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 informationImproved Starting Methods for Two-Step Runge Kutta Methods of Stage-Order p 3
Improved Starting Methods for Two-Step Runge Kutta Methods of Stage-Order p 3 J.H. Verner August 3, 2004 Abstract. In [5], Jackiewicz and Verner derived formulas for, and tested the implementation of two-step
More informationMTH 452/552 Homework 3
MTH 452/552 Homework 3 Do either 1 or 2. 1. (40 points) [Use of ode113 and ode45] This problem can be solved by a modifying the m-files odesample.m and odesampletest.m available from the author s webpage.
More informationIntegrating ODE's in the Complex Plane-Pole Vaulting
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1181-1189 Integrating ODE's in the Complex Plane-Pole Vaulting By George F. Corliss Abstract. Most existing algorithms for solving
More information