Order Results for Mono-Implicit Runge-Kutta Methods. K. Burrage, F. H. Chipman, and P. H. Muir
|
|
- Kenneth Armstrong
- 5 years ago
- Views:
Transcription
1 Order Results for Mono-Implicit Runge-Kutta Methods K urrage, F H hipman, and P H Muir bstract The mono-implicit Runge-Kutta methods are a subclass of the wellknown family of implicit Runge-Kutta methods and have application in the ecient numerical solution of systems of initial and boundary value ordinary dierential equations lthough the eciency and stability properties of this class of methods have been studied in a number of papers, the specic question of determining the maximum order of an s-stage mono-implicit Runge-Kutta method has not been dealt with In addition to the complete characterization of some subclasses of these methods having a small number of stages, and the presentation of some new methods from this class, a main result of this paper is a proof that the order of an s-stage mono-implicit Runge-Kutta method is at most s + Keywords: Runge-Kutta methods, ordinary dierential equations MS subject classication: 65L5 This work was supported by the Natural Sciences and Engineering Research ouncil of anada uthor addresses: Kurrage, entre for Industrial and pplied Mathematics and Parallel omputing, Department of Mathematics, The University of Queensland, risbane 472, ustralia kbmathsuqozau; FHhipman, cadia University, Wolfville, Nova Scotia, anada, P X chipmanacadiauca; PHMuir, Saint Mary's University, Halifax, Nova Scotia, anada, 3H 33 muirhuskystmarysca)
2 Introduction Implicit Runge-Kutta (IRK) methods were rst presented in [4] for use in the numerical solution of initial value ordinary dierential equations Since that time there has been considerable attention devoted to these methods The reader is referred to the book [5] for extensive review of these methods n IRK method can be used to compute an approximation to the solution of the initial value problem y (t) = f(y(t)); y(t i ) = y i ; where y(t) 2 R n and f : R n! R n (For convenience we will consider only autonomous systems) Using an IRK method, we obtain an approximation, y i+, to the true solution, y(t), evaluated at the point t i+ = t i + h i, of the form, where ^y r = y i + h i y i+ = y i + h i sx j= sx r= b r f(^y r ); (:) a r;j f(^y j ); r = ; : : : ; s: (:2) These methods are often given in the form of a tableau containing their coecients, which, for the above method, would have the following form c a ; : : : a ;s c s a s; : : : a s;s b : : : b s where c i = P s j= a i;j Let b = (b ; b 2 ; : : :; b s ) T, be the s s matrix whose (i; j)-th component is a i;j, and e is the vector of 's of length s Then c = (c ; c 2 ; : : :; c s ) T, can be expressed as c = e, and the stability function of the IRK method is given by R(h) = + hb T (I? h)? e: 2
3 Note that in (2) above, each stage, ^y r, is dened implicitly in terms of itself and the other stages Hence in order to obtain approximate values for the stages it is necessary to solve a system of, in general, n s non-linear equations This is often done using some form of modied Newton iteration, which makes the calculation of the stages a somewhat computationally expensive process number of interesting subclasses of the IRK methods have recently been identied and investigated in the literature These methods represent attempts to trade-o the higher accuracy of the IRK methods for methods which can be implemented more eciently Examples of such methods are singly-implicit Runge-Kutta methods [2], diagonally implicit Runge-Kutta methods [2], and mono-implicit Runge-Kutta methods (see [,] for initial value problems and [,3,5] for boundary value problems) See [8] for a survey of these methods In [8], an alternative representation of the IRK methods known parameterized implicit Runge-Kutta (PIRK) methods was suggested These have the form, y i+ = y i + h i sx r= b r f(^y r ); (:3) where ^y r = (? v r )y i + v r y i+ + h i sx j= x r;j f(^y j ); r = ; : : : ; s: (:4) They are usually represented by a modied tableau; the above method would have the tableau, c v x ; : : : x ;s c s v s x s; : : : x s;s b : : : b s ; where c i = v i + P s j= x i;j Substituting for y i+ from (3) in (4), it is easily seen that the PIRK method given above is equivalent to the IRK method with coecient tableau 3
4 c x ; + v b x ;2 + v b 2 : : : x ;s + v b s c s x s; + v s b x s;2 + v s b 2 : : : x s;s + v s b s b b 2 : : : b s : Let v = (v ; v 2 ; : : :; v s ) T and X be the s s matrix whose (i; j)-th component is x i;j Then c = Xe + v and, from [8], the stability function, R(h), of a PIRK satises R(h) = P (h; e? v) P (h;?v) ; where P (h; w) = + hb T (I? hx)? w; w 2 R s : If we impose on the PIRK methods the restriction that the matrix X be strictly lower triangular then the resultant methods are known as mono-implicit Runge-Kutta (MIRK) methods MIRK methods have been discussed in the literature by a number of dierent authors for more than a decade subclass of these methods was suggested for use in the solution of initial value ODE problems in [6] The full MIRK class was presented, again for initial value problems, in [] (where they were called implicit endpoint quadrature formulas) and [] MIRK methods were proposed for boundary value ODE's in [7,8,9,,3,5,6] For VODE's, these methods can be implemented at a cost comparable to that of explicit Runge-Kutta methods (See [Enright and Muir 986]) MIRK methods have been used in the implementation of a software package, for the numerical solution of VODE's, using deferred corrections, called HGRON [8], [2] More recently, the MIRK methods have been used in a software package which employs continuous extensions of these methods (see [9]) to provide defect control for the numerical solution of VODE's, [4] Much of the above work has been concerned with the identication of particular MIRK formulas and the investigation of their ecient implementation s well, there has been some investigation of the forms of the order conditions for these methods, as they relate to the well-known utcher conditions for the standard IRK methods, in [] and [6] However, 4
5 a complete characterization of low order MIRK methods has not been undertaken, as has been done for low order explicit Runge-Kutta methods, [5] This characterization is important because it allows an analysis of the resultant families to determine new optimal schemes representing potential improvements of those currently presented in the literature Furthermore, the question of the maximum order of an s-stage MIRK has not been answered In [7], it was conjectured that this maximum order is s + and in [7] the maximum order question was identied as a signicant open problem in the study of the MIRK methods In Section 2 we present characterizations for several subclasses of MIRK methods having a small number of stages In Section 3 we present some general results on the maximum order of an s-stage MIRK method, and show that an upper bound for the maximum order is s + In Section 4 we give some conclusions and suggestions for future work 2 Low Order Mono-Implicit Runge-Kutta Methods In this section we present characterizations for a number of families of low order MIRK methods, having, 2, 3, 4, or 5 stages For the standard IRK method to have stage order p, it must satisfy the conditions (p) and (p) (see eg [5, Pg 289]), where (p) : b T c k? = =k; k = ; : : : ; p; (p) : c k? = c k =k; k = ; : : : ; p; where c k = (c k ; c k 2; : : :; c k s) For a MIRK method to have stage order p, it must satisfy the conditions, (p), as given above, and the following form of the (p) conditions, (p) : v + kxc k? = c k ; k = ; : : : ; p; since for a MIRK scheme expressed in standard IRK form, we have = X + vb T lso, for an IRK or MIRK method to be of classical order p +, it is sucient for the method to satisfy (p + ) and (p) See [5, Pg 24-29] It has recently become clear (see for example [5]) that in addition to the usual Runge- Kutta order concept, it is important to take into consideration the stage order of the Runge- Kutta method, at least in the context of solving sti systems of dierential equations The 5
6 basic idea is that a p-th order Runge-Kutta method with stage order q, (q < p) when applied to a sti ode system, can yield errors of order q or q +, rather than the expected order p s mentioned above, in searching for new methods it is important to require relatively high stage order Ideally for a p-th order method, we would like to require stage order p? In the discussion to follow, for families of MIRK methods having s stages, where s = ; 2; 3, we will present methods of order s + having stage order s, and methods of order s, having stage order s? For families of MIRK methods having 4-stages we will present 4-th order methods with stage order 3, but the following theorem shows that there is no point in looking for 5th order methods with stage order 4 Theorem 2: (i) a MIRK method having stage order 2 must have c = or, (ii) a MIRK method, with at least 2 stages and having stage order 3, must have x 2; = and either c = ; c 2 = or (equivalently) c = ; c 2 =, and (iii) the maximum stage-order of an s stage MIRK method is min(s; 3) Proof: (i) The stage order 2 conditions for a MIRK method are v+xe = c, and v+2xc = c 2 The rst equation from each of these gives v = c and v = c 2 from which it follows that c = or (ii) The stage order 3 conditions are v + Xe = c, v + 2Xc = c 2, and v + 3Xc 2 = c 3 From (i) we have either c = or c = If c = then the second equation from each of these is v 2 + x 2; = c 2, v 2 = c 2 2, and v 2 = c 3 2, from which it follows that x 2; =, and c 2 = so that the rst and second stages are not the same similar argument holds for the case where c = (iii) For s = or 2, an s-stage MIRK method can only satisfy, simultaneously, (a) (s+) and (s), or (b) (s) and (s+) In either case this implies that the stage order is s For s 3, suppose the MIRK method has stage order 4 Then it must satisfy the (4) conditions which are v + Xe = c, v + 2Xc = c 2, v + 3Xc 2 = c 3, and v + 4Xc 3 = c 4 gain from (i) we have either c = or c = For each value of c, it follows from (ii) that x 2; = and c 2 = if c =, or c 2 = if c =, so that the second stage is dierent from the rst Repeating this process for the third equation from each set of (4) conditions we come to 6
7 the conclusion that the third stage must be the same as either the rst or the second stage, thus implying that the MIRK has only distinct s? stages, a contradiction Hence the stage order of an s-stage MIRK method, with s 3, is at most 3 2 MIRK methods with stage For the class of stage MIRK methods a family of methods of order, including the explicit and implicit Euler methods, is obtained when b = ; v = c with c left as a free parameter If we choose c =, then we obtain the unique -stage MIRK of maximum order 2 2, namely the mid-point rule 22 MIRK methods with 2 stages Specic examples of order 2 MIRK methods are the trapezoidal rule, (x 2; =, c = v =, c 2 = v 2 =, b = b 2 = ), and a one parameter family of 2nd order 2-stage MIRK 2 methods given in [] (Method II) more interesting question involves looking for 3rd order MIRK methods with 2 stages n example of such a method is the 2-point Gauss-Radau IRK method (Radau II), given in MIRK form in [], (Method III) In order to look for 3rd order methods we must examine the corresponding order conditions for a 2-stage MIRK method It is a straightforward process to convert the standard utcher conditions for IRK methods (see [5, pg 234]) to modied utcher conditions that can be applied directly to methods expressed in terms of the MIRK tableau, ie with the inclusion of the extra column of parameters v ; v 2 ; : : :; v s For example, for 3rd order 2-stage MIRK methods we have the following conditions: the quadrature conditions, denoted as (3), b + b 2 = ; b c + b 2 c 2 = 2 ; b c 2 + b 2 c 22 = 3 ; and the condition, b 2 x 2; c + 2 (b v + b 2 v 2 ) = 6 : Solving the above system, we get the following parameter family of 2-stage 3rd order MIRK methods (letting c be the parameter), 7
8 c c 3c? 2 3(2c? ) 36c 3? 54c c? 4 9(2c? ) 3? 2(3c2? 3c + ) 9(2c? ) 3 4(3c 2? 3c + ) 3(4c 2? 4c + ) 4(3c 2? 3c + ) : >From an examination of the order conditions for order 4 MIRK schemes, it can easily be seen that it is impossible to choose the one free parameter, c, so that the above family can be of 4th order Thus, for 2-stage MIRK methods the maximum order is 3 The linear stability function associated with this family of methods is R(z) = 6(? 2c) + 2(2? 3c)z + (? c)z2 6(? 2c)? 2(? 3c)z? cz 2 ; and the method is -stable if and only if c > 2 lso, note that if c2? c + 6 holds This is the MIRK analogue of the 2-stage Gauss method of order 4 = then (4) The above family of methods, in general, has only stage order To nd third order methods having stage order 2, we must impose the (2) conditions on the family of third order methods above We nd that the only members that have stage order 2 are obtained by choosing c = or in the () family which gives, respectively, Method III (from []) mentioned above (which is -stable) and its reection [2] (which is not -stable) 23 MIRK methods with 3 stages We will rst look for 3rd order, 3-stage methods having stage order 2 To establish order 3, stage order 2, it is necessary and sucient to impose the (3) and (2) conditions Stage order 2 implies either c = or c = We consider the c = case, noting that its reection [2] will yield the c = case We get the following 3-parameter family of methods where c 2, c 3, and v 3 are the parameters, with the restriction that, c 2, and c 3 are all dierent c 2 c 2 (2? c 2 ) c 2 (c 2? ) c 3 v 3 2(? c 2 ) 2(c 2? ) c 3 (c 3? 2c 2 ) + v 3 (2c 2? ) v 3 + c 3 (c 3? 2) 6c 2 c 3? 3c 3? 3c (c 2? )(c 3? ) 3c 3? 6(c 2? )(c 2? c 3 ) 3c 2? 6(c 3? )(c 3? c 2 ) 8
9 The linear stability function is 6 + 2(? )z + (c R(z) = 2? )z 2 6? 2(2 + )z + ( + (c 2 + ))z 2? c 2 z 3 where = (c 3? )(c 3? c 2 ); and = 2 (v 3 + c 3 (c 3? 2))(3c 2? ): The methods are -stable if and only if > and (3c 2? ) < : If we were to require stageorder 3, thus making c 2 = x 2; =, v 3 = c 2 3(3? 2c 3 ), x 3; = c 2 3(c 3? ), and x 3;2 = c 3 (c 3? ) 2 2, the resulting method is -stable if and only if c 3 > The reection [2] of this method, with c =, can only be -stable if c 2 =, and hence x 2; = If we now look for 3-stage, stage-order 2 MIRK methods with order 4 we get a oneparameter family of methods with either c = or c = ; (a requirement for stage-order 2) onsidering the case c =, we have the following -parameter family (where the parameter is c is a real number, satisfying c 6= ;, or ): 4 3 c c(2? c) c(c? ) 2c? 6c? 2 (? 2c)(? 4c) 2(c? ) 6c 2? 6c + 6(4c? )(c? ) (4c? ) 2(c? )? 6(c? ) 2(3c? ) 3 3(4c? ) where = 8c 4? 24c 3 + 2c 2? 26c + 2, = 4(3c? ) 4, =? c + 24c 2? 8c 3, and = 6c 2? 4c + The linear stability function for this family of methods is given by: R(z) = P (z; c) Q(z; c) = 2(? 3c) + 6(? 2c)z + (? c)z 2 2(? 3c)? 6(? 4c)z + (? 7c)z 2 + cz 3 ; and the methods are -stable if and only if c > 3 stage-order 3 or c = The choice of c = gives The c = case gives the stability function, R(z) = Q(?z;? c) P (?z;? c) ; 9
10 and hence methods that are only -stable for the one choice c =, the stage-order 3 case It is easy to show that this stage order 3 method is the only such 4th order, 3-stage method It is given [] (Method IV) and is obtained by choosing c = v =, c 2 = v 2 =, x 2; =, c 3 = v 3 =, and x 2 3; =?x 3;2 = 8 24 MIRK methods with 4 stages s might be expected, is not dicult to obtain 4-stage MIRK methods of order 4 Two examples are given in [] (Methods V and VII), both of which have stage order 2 elow we give a 3-parameter family of 4-stage, 4-th order methods having stage order 3 These are obtained by imposing the (4) and (3) conditions The parameters are c 3, c 4, and v 4, with the restrictions that c 3 6= c 4, c 3 6= ; ;, and c 2 4 6= ; c 3 c 2 3 (3? 2c 3) c 3 (c 3? ) 2 c 2 3 (c 3? ) c 4 v 4 6c 3 6(c 3? ) 6c 3 (c 3? ) 2c 4?? 2c 3 2c 3 c 4 2(? c 3 )(? c 4 ) 2c 3 (c 4? c 3 )(? c 3 ) 2c 4 (c 4? c 3 )(? c 4 ) where = 6c 4 c 3 +v 4?3c 3 v 4?3c 3 c 2 4+2c 3 4?3c2 4, = 3c 3 (c 2 4?v 4)?2(c 3 4?v 4), =?2(c 3 +c 4 )+6c 3 c 4, = 3? 4(c 3 + c 4 ) + 6c 3 c 4, and = c 2 4(2c 4? 3) + v 4 The linear stability function is, R(z) = p + p z + p 2 z 2 + p 3 z 3 q + q z + q 2 z 2 + q 3 z 3 ; where, p = q = 2c 4 (c 4? )(c 4? c 3 ); p = 6c 4 (c 4? )(c 4? c 3 )? (c 2 4(2c 4? 3) + v 4 )(2c 3? ); q =?6c 4 (c 4? )(c 4? c 3 )? (c 2 4(2c 4? 3) + v 4 )(2c 3? ); p 2 = c 4 (c 4? )(c 4? c 3 ) + 3 (c2 4(2c 4? 3) + v 4 )(c 3? 2)(2c 3? ); q 2 = c 4 (c 4? )(c 4? c 3 ) + 3 (c2 4(2c 4? 3) + v 4 )(c 3 + )(2c 3? ); p 3 = 6 (c2 4(2c 4? 3) + v 4 )(2c 3? )(c 3? ); q 3 =? 6 (c2 4(2c 4? 3) + v 4 )c 3 (2c 3? ):
11 The family will be -stable if and only if c 3 > =2 and (2c 3? ) 6c 4 (c 4? )(c 4? c 3 ) > It is also possible to generate 4-stage, 5th order MIRK methods However from Theorem 2, it is only worthwhile to look for 4-stage, 5th order MIRK methods having at most stage order 3 elow we present a 4-stage, 5th order family of stage order 2, which includes a 4-stage, 5th order family of stage order 3 The stage order 2 family has 2 parameters, c 2 and c 3 c 2 c 2 (2? c 2 ) c 2 (c 2? ) c 3 c 3 (2? c 3 ) + 2x 3;2 (c 2? ) c 3 (c 3? )? x 3;2 (2c 2? ) x 3;2 5 5? x 4;? x 4;2? x 4;3 x 4; x 4;2 x 4;3? b 2? b 3? b 4 (c 3 ) (c 2 ) 25 4 (c 2 ; c 3 ) (c 3 ; c 2 ) 2 where = c 2 c 3? 5(c 2 + c 3 ) + 3, = 6c 2 c 3? 2(c 2 + c 3 ) +, = (5? )(5c 2? )(5c 3? ), (c) = c 2? 8c +, where c = c 2, or c 3, (c; d) = 2(? c)(d? c)(5c? ), where c; d = c 2 ; c 3, or c 3 ; c 2, and x 3;2 = (2c 2c 3 + c 2 + c 3? )(? c 3 )(c 2? c 3 ) ; (3c 2? )(c 2? )(c 2 ) x 4; = 5 ( 5? )? x (c 4;3(2c 3? )? x 4;2 (2c 2? ); x 4;3 = 2 ) (c 3? )(c 2? c 3 ) ; x 4;2 = (5? )(5c 2? )(5c 3? 2)? 25 3 x 4;3 (3c 3? )(c 3? ) : 25 3 (3c 2? )(c 2? ) There are several restrictions on the values of the two parameters: c 2 6= c 3, c 2 6= 3 ;, c 3 6=, (c 2 ) 6=, 6=, 6=, (c 2 ; c 3 ) 6=, and (c 3 ; c 2 ) 6= The linear stability function for this family is given by R(z) = w + w z + w 2 z 2 + w 3 z 3 t? t z? t 2 z 2? t 3 z 3? t 4 z 4 ; where w = t = 6(3c 2? ); w = 2(3c 2? ); w 2 = 3(3c 2? ) + 6(? 2)(2c 2? ); w 3 = (? 2)(c 2? )
12 and t = 2(3c 2? )(5? ); t 2 = 6(? 2)(4c 2? )? 9(3c 2? ); t 3 = (3c 2? )? (7c 2? )(? 2); t 4 = c 2 (? 2): The methods are -stable if and only if < (2? )(2c 2 + ) (3c 2? ) < 2 one parameter 4-stage, 5th order, stage order 3 family, contained within the above family, is obtained simply by choosing c 2 = In this case, the methods are -stable if and only if c 3 > 25 MIRK methods with 5 stages We focus, in this section, on 5-stage methods of maximum order 6 n example of such a method is given in [] (Method VIII), where the stage order has the maximum value of 3 This method is generalized to a 5-stage, 6th order -parameter family of methods having stage order 3, in [6] (Table 2) In this section we complete the generalization of these methods by presenting a 2-parameter family of 5-stage, 6-th order methods having stage (? p) ( + p) order 3 The parameters are c 3 and c 4 ; by choosing c 3 = and c 2 4 = we get the 2 one parameter family (with parameter p) given in [6] The restrictions on the parameters c 3 and c 4 are c 3 6= ;, c 4 6= ;, 6= 6=, (c 3 ) 6=, (c 4 ) 6=, (c 3 ; c 4 ) 6=, (c 4 ; c 3 ) 6=, (c 3 ) 6=, and (c 4 ) 6= The 2-parameter family is given below c 3 c 2 3 (3? 2c 3) c 3 (c 3? ) 2 c 2 3 (c 3? ) c 4 c 2 4 (3? 2c 4) + 6x 4;3 c 3 (c 3? ) x 4; x 4;2 (c 3 + c 4? ) (c 4 ; c 3 ) 2(c 3 )(c 3 )? x 5;? x 5;2? x 5;3? x 5;4 x 5; x 5;2 x 5;3 x 5;4 b b 2 b 3 b 4 b 5 where x 4; = c 4 (c 4? ) 2? x 4;3 (3c 3? )(c 3? ); x 4;2 = c 2 4(c 4? )? x 4;3 (3c 3? 2)c 3 ; 2
13 b 3 = x 5; = c 5 (c 5? ) 2? x 5;3 (3c 3? )(c 3? )? x 5;4 (3c 4? )(c 4? ); x 5;2 = c 2 5(c 5? )? x 5;3 (3c 3? 2)c 3? x 5;4 (3c 4? 2)c 4 ; x 5;3 = 6b 5 (c 3 )? x b 4 (c 4 ) 4;3? x 5;4 b 5 (c 3 ) ; x 5;4 = (? )(c 3)(c 3 )(c 4 ) ; (c 4 ; c 3 ) 6 b = 5c2 3(c 2 4? 2c 4 + 3)? 5c 3 (2c 2 4? 5c 4 + 4) + (5c 2 4? 2c 4 + 6) ; 6(c 3? )(c 4? )(? ) b 2 = 5c2 3(c 2 4? 8c 4 + )? 5c 3 (8c 2 4? 7c 4 + ) + (c 4 ) ; 6c 3 c 4 (c 4 ) 6 (c 3 ; c 4 )(c 3 ) ; b 4 = (c 3 ) 6 (c 4 ; c 3 )(c 4 ) ; b 5 = 5 6(? )(c 3 )(c 4 ) ; and where = 5c 4 c 3? 3(c 3 + c 4 ) + 2, = c 3 c 4? 5(c 3 + c 4 ) + 3, (c) = 5c 2? 5c +, (c) = c(c? )(2c? ), (c) = c?, and (c; d) = c(c? )(c? d) The linear stability function is, R(z) = w + w z + w 2 z 2 + w 3 z 3 + w 4 z 4 t? t z? t 2 z 2? t 3 z 3? t 4 z 4 ; where w = t = 2(2c 3? ); w = 2(2c 3? ); t = 2(2c 3? )(5c 3 c 4? 2(c 3 + c 4 ) + ) w 2 = 2(2c 32 c 4? 25c 3 c 4 + 7c 4? 5c c 3? 5); t 2 =?2(2c 2 3c 4? 5c 3 c 4 + 2c 4? 5c c 3 ); w 3 = 2(c 2 3c 4? 6c 3 c 4 + 4c 4? c c 3? 3); t 3 = 2(c 32 c 4? 4c 3 c 4? 2c 4 + c 2 3? 5c 3 + 3); w 4 = c 3 (? c 3? c 4 ); t 4 = (c 3? )(? c 3? c 4 ): The methods are -stable if and only if c 3 < =2 and (? c 3? c 4 ) 3 The Maximum Order of n s-stage MIRK Method > In this section, we will present a proof giving an upper bound on the order of an s- stage MIRK scheme, as given in (3),(4), with coecients represented by the vectors, c = (c ; c 2 ; : : : ; c s ) T, v = (v ; v 2 ; : : : ; v s ) T, b = (b ; b 2 ; : : : ; b s ) T, and the strictly lower triangular s s matrix X, whose (i; j)-th component is x ij s before, e is the vector of 's of length s The proof is based on a subset of the Runge-Kutta order conditions, which we now present Lemma 3: For an s-stage, order s + 2 MIRK scheme b T X k?p (c p+? c) = b T X k?p+ ((p + )c p? e); p = ; ; : : :; s; k = p; : : :; s: (T ) 3
14 (We refer to these conditions as the "cabbage tree" conditions (T's), since they are based on the order conditions associated with a tree consisting of a trunk of i edges surmounted by a bunch of j edges) Proof: mong the order conditions that any Runge-Kutta scheme of order s+2 must satisfy are b T k?p+ c p = p!=(k + 2)! and b T k?p c p+ = (p + )!=(k + 2)!: Let t = c p+? (p + )c p : Then b T k?p t = ; p = ; ; : : :; s k = p; : : :; s; giving (for a MIRK scheme where = X + vb T ), b T k?p t = b T (X + vb T ) k?p? t = b T X k?p? t = b T X 2 k?p?2 t = : : : = b T X k?p t = : Since, for a MIRK scheme, v = c? Xe, we get, from which the result follows b T X k?p (c p+? (p + )X(c p? e )? c) = ; p + We note that since X is strictly lower triangular, the vector b T X i has at least i zero elements, in the last i positions We are interested in the (potentially) non-zero elements only, and so shall denote by y i = (y i; : : :; y i;i ) T, the vector of length i consisting of the rst i elements of b T X s?i With a k by k matrix, and V k? = V k = c 2? c c 2 2? c 2 : : : c 2 k? c k c 3? c c 3 2? c 2 : : : c 3? c k k c k+? c c k+ 2? c 2 : : : c k+ k? c k 2c? 2c 2? : : : 2c k?? 3c 2? 3c 2? : : : 3c 2? k? (k + )c k? (k + )c k 2? : : : (k + )c k k?? 4 ; ;
15 a k by k? matrix, the T's may be grouped and rewritten as, V y = ; () and nally, V 2 y 2 = V y ; (2) V 3 y 3 = V 2 y 2; (3) V s? y s? = V s?2 y s?2; (s? ) V s?y s? =? 2 =3 2=4 s=s + 2 ; (s) where we note that T(k) consists of k equations, k = : : : s In the remainder of this proof, the right hand sides of some of the T's will reduce to the zero vector When it arises in T(k), will denote the zero vector of length k In the proof of the main result that follows, we will need two lemmas Lemma 32: Suppose the matrix V k? is non-singular and c 2 k = c k Then the matrix, is nonsingular ^V k = c 2? c : : : c 2 k?? c k? 2c k? c k+? c : : : c k+ k?? c k? (k + )c k k? Proof: Let f(c k ) = det(v k ) and note that f has simple zeros at c k = and c k = Hence f (c k ) is non-zero at c k = ; ut f (c k ) is just det( ^Vk ), proving the result ; Lemma 33: Suppose that the abscissa, fc i g; i = ; : : :; l, are distinct, and that the matrix V k? is non-singular Further suppose that c 2 k = c k, c 2 6= c j j; j = k + ; : : : ; l?, and c 2 l = c l Then the matrix, ^V l, given by, 5
16 c 2? c : : : c 2 k?? c k? 2c k? c 2 k+? c k+ : : : c 2 l?? c l? 2c l? c l+? c : : : c l+ k?? c k? (k + )c l k? cl+ k+? c k+ : : : c l+ l?? c l? (l + )c l l? is nonsingular Proof: Let f(c k ; c l ) = det(v l ) and note that f has simple zeros at c k = or and c l = or Hence 2 f(c k ; c l ) is non-zero at fc k = ; c l = g or fc k = ; c l = g ut 2 f(c k ; c l ) is just c k c l c k c l det( ^V l ), proving the result We now in a position to present and prove the main result Theorem 34 The maximum order of an s-stage MIRK cannot exceed s + Proof: If s = or 2, then the result follows from sections 2 and 22 Hence we assume s 3 Suppose there is an s-stage MIRK of order s + 2 We consider the T's one at a time T() states that (c 2? c )y ; =, and hence at least one of these two factors must vanish Suppose c 2? c = Then, in fact, y ; must also be zero, for consider T (2), which becomes! c 2 2? c 2 y 2;2 =? c 3 2? c 2?! If y ; 6=, then c 2 = or, both of which are impossible Hence y ; = y = This result holds independently of whether or not c 2 = c, c 2 2 = c 2, or c = c 2 Note that ky y ; or det(v k ) = ( i=(c 2 i? c i ))( Y (c i? c j )); i<j and hence if all the c i are distinct and dierent from zero or one, then the T's from () through (s? ) give y i = for all i = ; : : :; s? : T(s) then obviously fails to hold Thus we see that if there is to be any possibility for an order s+2 method to exist, we must satisfy at least one of the conditions 2! y ; : c 2 i = c i ; i 2 f; : : :; sg or c i = c j for i 6= j; i; j 2 f; : : : ; sg: 6 ;
17 We shall refer to these as singularities of type I (c 2 i = c i ) and type II (c i = c j ; i 6= j) Suppose the rst singularity that we encounter is of type II and involves c k, ie c k = c i for one i k? lso, since this is the rst singularity, det(v k? ) 6= ; and y i = ; i = : : : k? : T(k) becomes c 2? c : : : c 2 k?? c k? : : : c k+? c : : : c k+ k?? c k? y k; y k;i + y k;k = : y k;k? We see the eect of a singularity of this type is to replace the y k;i term in y k by y k;i + y k;k, and reduce the dimension of this T by one Furthermore this same eect occurs in all the subsequent T's, (k + ); : : :; s Indeed, all subsequent type II singularities produce this same kind of eect Each singularity leads to a modication of the y i vectors and the T's, with a reduction by one in the size of each set of conditions Thus if we modify the original T's (and y i vectors) according to the presence of all type II singularities, the result will be a set of modied T's, smaller in dimension than the original set but with the same structure The advantage of considering this modied set of T's is that we can restrict our attention to only type I singularities, ie we can assume that all abscissa are distinct In the remainder of this proof we will use the same notation as above for the T's and y i vectors but will assume that the system of conditions has been reduced to remove all type II singularities Let us now consider this set of reduced T's, and suppose that no type I singularities are present Then, T() gives y =, and in each subsequent set of conditions, V k ; k = 2; : : :; s? is nonsingular, so we get, y i = The nal condition, T(s), then leads to an obvious contradiction (This contradiction is obtained no matter what the dimension of reduced T's) Hence, there must be at least one type I singularity if there is to be any chance for the existence of an s-stage, order s + 2 MIRK scheme 7
18 (In fact, there can be at most two type I singularities The rst type I singularity would imply that the corresponding abscissa is or The second would similarly imply that the corresponding abscissa is or, but dierent than that of the rst, since we have assumed the absence of all type II singularities The third type I singularity would imply that the corresponding abscissa is or, and thus equal to one of the previous two abscissas associated with the type I singularities, an impossibility, given the absence of all type II singularities) We now continue our examination of the reduced T's and assume that the rst type I singularity involves c k Then c 2 k = c k and T(k) gives c 2? c : : : c 2 k?? c k? : : : c k+? c : : : c k+ k?? c k? y k; y k;k? = ; and since this coecient matrix is nonsingular, y k; = : : : = y k;k? = and y k;k is arbitrary T(k + ) now gives c 2? c : : : c 2 k?? c k? 2c k? c 2 k+? c k+ c k+2? c : : : c k+2 k?? c k? (k + 2)c k+ k? c k+2 k+? c k+ y k+; y k+;k? y k;k y k+;k+ = : learly y k+;k is arbitrary and its place has been taken by y k;k Suppose that there is exactly one type I singularity present Then the above coecient matrix is seen to be nonsingular by interchanging the last two columns and using lemma 32, and thus we have y k;k =, y k+;k arbitrary, and all the remaining components of y k+ equal to zero 8
19 If we next consider T(k + 2), we get a similar structure, c 2? c : : : c 2 k?? c k? 2c k? c 2 k+? c k+ c 2 k+2? c k+2 c k+3? c : : : c k+3 k?? c k? (k + 3)c k+2 k? c k+3 k+? c k+ c k+3 k+2? c k+2 gain, lemma 32 gives y k+;k = and all components of y k+2 y k+2; y k+2;k? y k+;k y k+2;k+ y k+2;k+2 = : equal to zero except the kth one, which is arbitrary This same eect obviously continues for each subsequent T and corresponding y i vector, leading to the observation that y s? has all zero exponents, except for the kth one, which is arbitrary Then T(s) becomes, 2c k? y s?;k =? 2 (s + )c s? k where c k = or learly the rst two equations of the above condition lead to a contradiction Hence, if there is any chance for an s stage MIRK scheme to be of order s + 2, there must be two type I singularities (Note that if all the abscissa are equal, then there can be at most one type I singularity, and the proof ends here) The nal possibility is that there is a second type I singularity, which we will suppose involves c l ; l > k That is c 2 l s s+2 = c l with c l 6= c k Then T(l) has the form, c 2? c : : : c 2 k?? c k? 2c k? c 2 k+? c k+ : : : c 2 l?? c l? c l+? c : : : c l+ k?? c k? (l + )c l k? cl+ k+? c k+ : : : c l+ l?? c l? ; y l; y l;k? y l?;k y l;k+ with y l;k and y l;l, arbitrary Rearranging columns of the above coecient matrix and applying lemma 32 shows that the above matrix is nonsingular and thus y l?;k =, and all components of y l are zero, except for the kth and lth, which are arbitrary The (l + )st T becomes, 9 y l;l? = ;
20 c 2? c : : : c 2 k?? c k? 2c k? c 2 k+? c k+ : : : c 2 l?? c l? 2c l? c l+2? c : : : c l+2 k?? c k? (l + 2)c l+ k? c l+2 k+? c k+ : : : c l+2 l?? c l? (l + 2)c l+ l? y l+; y l+;k? y l;k y l+;k+ y l+;l? = ; y l;l with y l+;k and y l+;l arbitrary Lemma 33 shows that the above coecient matrix is nonsingular and thus we have y l;k = y l;l =, and all components of y l+ equal to zero, except the kth and lth, which are arbitrary Obviously this eect continues through the subsequent T's, and we reach the conclusion that y s? has all components equal to zero, except the kth and lth, which are arbitrary T(s) becomes 2c k? y s?;k + (s + )c s? k 2c l? y s?;l =? 2 (s + )c s? l with c k = and c l =, or c k = and c l = The rst three equations in this system are then impossible to satisfy This completes the nal possibility for the existence of an s-stage, order s + 2 MIRK scheme, and we conclude that no such scheme can exist 4 onclusions In this paper we have extended the knowledge of the class of mono-implicit Runge-Kutta methods in several ways We have completely characterized many of the lower stage, lower order families of this class which have optimal stage order This is signicant, when solving sti problems for example, because it is now known that in this case the stage order rather than the classical order is the appropriate measure of the accuracy of the method (see [5]) These characterizations will be useful in an analysis for determination of new formulas for use in a boundary value ODE code using defect control, under development by one of the authors general result giving a maximum bound of 3 for the stage order of an s-stage MIRK formula was given main result of this paper shows that the order of an s-stage MIRK s s+2 ;
21 method is bounded by s + >From the results of section 2, we have presented formulas having s = ; 2; 3; 4, and 5, for which this bound is met We conjecture that the bound cannot be met for s 6 Future work in this area could include a systematic investigation of the linear and nonlinear stability properties of the various families of MIRK methods identied in section 2, as well as possible further attempts to completely characterize low stage MIRK methods having lower stage orders lso, an investigation of the possibility of embedded families of MIRK methods of various orders would be very useful for error estimation purposes in software implementations for both in the initial value and boundary value problem areas (Some embedded families of MIRK methods have been presented in [] and [6]) 5 References [] W M G van okhoven, Ecient higher order implicit one-step methods for integration of sti dierential equations, IT 2 (98), 34{43 [2] K urrage, special family of Runge-Kutta methods for solving sti dierential equations, IT 8 (978), 22{4 [3] K urrage, Order properties of implicit multivalue methods for ordinary dierential equations, IM J Num nal 8 (989), 43{69 [4] J utcher, Implicit Runge-Kutta processes, Math omp 8 (964), 5{64 [5] J utcher, \The Numerical nalysis of Ordinary Dierential Equations," John Wiley & Sons, Toronto, 987 [6] J R ash, class of implicit Runge-Kutta methods for the numerical integration of sti dierential systems, J M 22 (975), 54{5 [7] J R ash, On the numerical integration of nonlinear two-point boundary value problems using iterated deferred corrections, Part : survey and comparison of some one-step formulae, omput Math ppl 2a (986), 29{48 [8] J R ash, On the numerical integration of nonlinear two-point boundary value problems using iterated deferred corrections, Part 2: The development and analysis of highly stable 2
22 deferred correction formulae, SIM J Numer nal 25 (988), 862{882 [9] J R ash and D R Moore, high order method for the numerical solution of two-point boundary value problems, IT 2 (98), 44{52 [] J R ash and Singhal, Mono-implicit Runge-Kutta formulae for the numerical integration of sti dierential systems, IM J Numer nal 2 (982), 2{227 [] J R ash and Singhal, High order methods for the numerical solution of two-point boundary value problems, IT 22 (982), 84{99 [2] J R ash and M H Wright, deferred correction method for nonlinear two-point boundary value problems: implementation and numerical evaluation, omputer Science Technical Report 46, T&T ell Laboratories (989) [3] W H Enright and P H Muir, Ecient classes of Runge-Kutta methods for two-point boundary value problems, omputing 37 (986), 35{334 [4] W H Enright and P H Muir, Runge-Kutta Type oundary Value ODE Solver with Defect ontrol, in preparation (992) [5] R Frank, J Schneid, and W Ueberhuber, Order results for implicit Runge-Kutta methods applied to sti systems, SIM J Numer nal 23 (985), 55{534 [6] S Gupta, n adaptive boundary value Runge-Kutta solver for rst order boundary value problems, SIM J Numer nal 22 (985), 4{26 [7] P H Muir, Implicit Runge-Kutta methods for two-point boundary value problems, PhD Thesis, Department of omputer Science, University of Toronto; lso Department of omputer Science, Tech Rep 75/84, University of Toronto (984) [8] P H Muir and W H Enright, Relationships among some classes of IRK methods and their stability functions, IT 27 (987), 43{423 [9] P H Muir and rynjulf Owren, Order arriers and haracterizations for ontinuous Mono-Implicit Runge-Kutta Schemes, submitted to Math omp (992) [2] S P Nrsett, Semi-Explicit Runge-Kutta Methods, Mathematics and omputation 22
23 No6/74, University of Trondheim (974) [2] R Scherer and H Turke, Reected and Transposed methods, IT 23 (983), 262{266 23
[4] for use in the numerical solution of initial value ordinary differential equations.
SIAM J. NUMER. ANAL. Vol. 31, No. 3, pp. 876-891, June 1994 () 1994 Society for Industrial and Applied Mathematics 015 _ ORDER RESULTS FOR MONO-IMPLICIT RUNGE-KUTTA METHODS* K. BURRAGEt, F. H. CHIPMAN$,
More informationStrang-type Preconditioners for Solving System of Delay Dierential Equations by Boundary Value Methods Raymond H. Chan Xiao-Qing Jin y Zheng-Jian Bai
Strang-type Preconditioners for Solving System of Delay Dierential Equations by oundary Value Methods Raymond H. han iao-qing Jin y Zheng-Jian ai z ugust 27, 22 bstract In this paper, we survey some of
More informationMultistage Methods I: Runge-Kutta Methods
Multistage Methods I: Runge-Kutta Methods Varun Shankar January, 0 Introduction Previously, we saw that explicit multistep methods (AB methods) have shrinking stability regions as their orders are increased.
More informationonly nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr
The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands
More informationThe WENO Method for Non-Equidistant Meshes
The WENO Method for Non-Equidistant Meshes Philip Rupp September 11, 01, Berlin Contents 1 Introduction 1.1 Settings and Conditions...................... The WENO Schemes 4.1 The Interpolation Problem.....................
More information= c c + g (n; c) (.b) on the interior of the unit square (; ) (; ) in space and for t (; t final ] in time for the unknown functions n(x; y; t)
Splitting Methods for Mixed Hyperbolic-Parabolic Systems Alf Gerisch, David F. Griths y, Rudiger Weiner, and Mark A. J. Chaplain y Institut fur Numerische Mathematik, Fachbereich Mathematik und Informatik
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 informationInstitute for Advanced Computer Studies. Department of Computer Science. Two Algorithms for the The Ecient Computation of
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{98{12 TR{3875 Two Algorithms for the The Ecient Computation of Truncated Pivoted QR Approximations
More informationhapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati
Lectures on Dynamic Systems and ontrol Mohammed Dahleh Munther Dahleh George Verghese Department of Electrical Engineering and omputer Science Massachuasetts Institute of Technology c hapter 8 Simulation/Realization
More informationNumerical Solution of Hybrid Fuzzy Dierential Equation (IVP) by Improved Predictor-Corrector Method
Available online at http://ijim.srbiau.ac.ir Int. J. Industrial Mathematics Vol. 1, No. 2 (2009)147-161 Numerical Solution of Hybrid Fuzzy Dierential Equation (IVP) by Improved Predictor-Corrector Method
More informationAdaptive nested implicit Runge Kutta formulas of Gauss type
Applied Numerical Mathematics 59 (9) 77 7 www.elsevier.com/locate/apnum Adaptive nested implicit Runge Kutta formulas of Gauss type G.Yu. Kulikov, S.K. Shindin School of Computational and Applied Mathematics,
More informationLECTURE 15 + C+F. = A 11 x 1x1 +2A 12 x 1x2 + A 22 x 2x2 + B 1 x 1 + B 2 x 2. xi y 2 = ~y 2 (x 1 ;x 2 ) x 2 = ~x 2 (y 1 ;y 2 1
LECTURE 5 Characteristics and the Classication of Second Order Linear PDEs Let us now consider the case of a general second order linear PDE in two variables; (5.) where (5.) 0 P i;j A ij xix j + P i,
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 information19.2 Mathematical description of the problem. = f(p; _p; q; _q) G(p; q) T ; (II.19.1) g(p; q) + r(t) _p _q. f(p; v. a p ; q; v q ) + G(p; q) T ; a q
II-9-9 Slider rank 9. General Information This problem was contributed by Bernd Simeon, March 998. The slider crank shows some typical properties of simulation problems in exible multibody systems, i.e.,
More informationThe collocation method for ODEs: an introduction
058065 - Collocation Methods for Volterra Integral Related Functional Differential The collocation method for ODEs: an introduction A collocation solution u h to a functional equation for example an ordinary
More informationRunge-Kutta and Collocation Methods Florian Landis
Runge-Kutta and Collocation Methods Florian Landis Geometrical Numetric Integration p.1 Overview Define Runge-Kutta methods. Introduce collocation methods. Identify collocation methods as Runge-Kutta methods.
More informationMODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione
MODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione, Univ. di Roma Tor Vergata, via di Tor Vergata 11,
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 information460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses
Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:
More informationLinear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation
More informationA SYMBOLIC-NUMERIC APPROACH TO THE SOLUTION OF THE BUTCHER EQUATIONS
CANADIAN APPLIED MATHEMATICS QUARTERLY Volume 17, Number 3, Fall 2009 A SYMBOLIC-NUMERIC APPROACH TO THE SOLUTION OF THE BUTCHER EQUATIONS SERGEY KHASHIN ABSTRACT. A new approach based on the use of new
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More information1 Matrices and Systems of Linear Equations
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation
More informationconsideration, is indispensable. Due to the great number of restarts, one for each split-step time interval, it is particularly important to use integ
Gauss-Seidel Iteration for Sti ODEs from Chemical Kinetics J.G. Verwer CWI P.O. Box 94079, 1090 GB Amsterdam, The Netherlands Abstract A simple Gauss-Seidel technique is proposed which exploits the special
More informationStability of implicit extrapolation methods. Abstract. Multilevel methods are generally based on a splitting of the solution
Contemporary Mathematics Volume 00, 0000 Stability of implicit extrapolation methods Abstract. Multilevel methods are generally based on a splitting of the solution space associated with a nested sequence
More informationreal and symmetric positive denite. The examples will only display the upper triangular part of matrices, with the understanding that the lower triang
NEESSRY ND SUFFIIENT SYMOLI ONDITION FOR THE EXISTENE OF INOMPLETE HOLESKY FTORIZTION XIOGE WNG ND RNDLL RMLEY DEPRTMENT OF OMPUTER SIENE INDIN UNIVERSITY - LOOMINGTON KYLE. GLLIVN DEPRTMENT OF ELETRIL
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 informationPolynomial functions over nite commutative rings
Polynomial functions over nite commutative rings Balázs Bulyovszky a, Gábor Horváth a, a Institute of Mathematics, University of Debrecen, Pf. 400, Debrecen, 4002, Hungary Abstract We prove a necessary
More information1. Introduction Let the least value of an objective function F (x), x2r n, be required, where F (x) can be calculated for any vector of variables x2r
DAMTP 2002/NA08 Least Frobenius norm updating of quadratic models that satisfy interpolation conditions 1 M.J.D. Powell Abstract: Quadratic models of objective functions are highly useful in many optimization
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 informationusing the Hamiltonian constellations from the packing theory, i.e., the optimal sphere packing points. However, in [11] it is shown that the upper bou
Some 2 2 Unitary Space-Time Codes from Sphere Packing Theory with Optimal Diversity Product of Code Size 6 Haiquan Wang Genyuan Wang Xiang-Gen Xia Abstract In this correspondence, we propose some new designs
More informationG METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE
G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE UDREA PÄUN Communicated by Marius Iosifescu The main contribution of this work is the unication, by G method using Markov chains, therefore, a
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationAdvanced methods for ODEs and DAEs
Advanced methods for ODEs and DAEs Lecture 8: Dirk and Rosenbrock Wanner methods Bojana Rosic, 14 Juni 2016 General implicit Runge Kutta method Runge Kutta method is presented by Butcher table: c1 a11
More informationIntegrating-Factor-Based 2-Additive Runge Kutta methods for Advection-Reaction-Diffusion Equations
Integrating-Factor-Based 2-Additive Runge Kutta methods for Advection-Reaction-Diffusion Equations A Thesis Submitted to the College of Graduate Studies and Research in Partial Fulfillment of the Requirements
More informationGauge transformations of constrained KP ows: new integrable hierarchies. Anjan Kundu and Walter Strampp. GH{Universitat Kassel. Hollandische Str.
Journal of Mathematical Physics 36(6) (1995), pp. 2972{2984 Gauge transformations of constrained KP ows: new integrable hierarchies Anjan Kundu and Walter Strampp Fachbereich 17{Mathematik/Informatik GH{Universitat
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 informationCounterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co
Counterexamples to witness conjectures Joris van der Hoeven D pt. de Math matiques (b t. 45) Universit Paris-Sud 91405 Orsay CEDEX France August 15, 003 Consider the class of exp-log constants, which is
More informationAbstract. The probabilistic approach isused for constructing special layer methods to solve thecauchy problem for semilinear parabolic equations with
NUMERICAL METHODS FOR NONLINEAR PARABOLIC EQUATIONS WITH SMALL PARAMETER BASED ON PROBABILITY APPROACH GRIGORI N. MILSTEIN, MICHAEL V. TRETYAKOV Weierstra -Institut f r Angewandte Analysis und Stochastik
More informationControl Problems in DAE. with Application to Path Planning Problems for. Volker H. Schulz. published as: Preprint 96-12,
Reduced SQP Methods for Large-Scale Optimal Control Problems in DAE with Application to Path Planning Problems for Satellite Mounted Robots Volker H Schulz PhD thesis at the University of Heidelberg published
More informationInvariants under simultaneous conjugation of SL 2 matrices
Invariants under simultaneous conjugation of SL 2 matrices Master's colloquium, 4 November 2009 Outline 1 The problem 2 Classical Invariant Theory 3 Geometric Invariant Theory 4 Representation Theory 5
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
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 informationAPPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS
LECTURE 10 APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS Ordinary Differential Equations Initial Value Problems For Initial Value problems (IVP s), conditions are specified
More informationReduction of two-loop Feynman integrals. Rob Verheyen
Reduction of two-loop Feynman integrals Rob Verheyen July 3, 2012 Contents 1 The Fundamentals at One Loop 2 1.1 Introduction.............................. 2 1.2 Reducing the One-loop Case.....................
More informationExplicit One-Step Methods
Chapter 1 Explicit One-Step Methods Remark 11 Contents This class presents methods for the numerical solution of explicit systems of initial value problems for ordinary differential equations of first
More informationIncomplete Block LU Preconditioners on Slightly Overlapping. E. de Sturler. Delft University of Technology. Abstract
Incomplete Block LU Preconditioners on Slightly Overlapping Subdomains for a Massively Parallel Computer E. de Sturler Faculty of Technical Mathematics and Informatics Delft University of Technology Mekelweg
More informationAbstract. Jacobi curves are far going generalizations of the spaces of \Jacobi
Principal Invariants of Jacobi Curves Andrei Agrachev 1 and Igor Zelenko 2 1 S.I.S.S.A., Via Beirut 2-4, 34013 Trieste, Italy and Steklov Mathematical Institute, ul. Gubkina 8, 117966 Moscow, Russia; email:
More information1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound)
Cycle times and xed points of min-max functions Jeremy Gunawardena, Department of Computer Science, Stanford University, Stanford, CA 94305, USA. jeremy@cs.stanford.edu October 11, 1993 to appear in the
More informationModule 6: Implicit Runge-Kutta Methods Lecture 17: Derivation of Implicit Runge-Kutta Methods(Contd.) The Lecture Contains:
The Lecture Contains: We continue with the details about the derivation of the two stage implicit Runge- Kutta methods. A brief description of semi-explicit Runge-Kutta methods is also given. Finally,
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 informationSYSTEMS OF ODES. mg sin ( (x)) dx 2 =
SYSTEMS OF ODES Consider the pendulum shown below. Assume the rod is of neglible mass, that the pendulum is of mass m, and that the rod is of length `. Assume the pendulum moves in the plane shown, and
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 information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationCombining estimates in regression and. classication. Michael LeBlanc. and. Robert Tibshirani. and. Department of Statistics. cuniversity of Toronto
Combining estimates in regression and classication Michael LeBlanc and Robert Tibshirani Department of Preventive Medicine and Biostatistics and Department of Statistics University of Toronto December
More informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More informationValidating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract
Validating an A Priori Enclosure Using High-Order Taylor Series George F. Corliss and Robert Rihm Abstract We use Taylor series plus an enclosure of the remainder term to validate the existence of a unique
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 informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationStability of the Parareal Algorithm
Stability of the Parareal Algorithm Gunnar Andreas Staff and Einar M. Rønquist Norwegian University of Science and Technology Department of Mathematical Sciences Summary. We discuss the stability of the
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More informationStability of implicit-explicit linear multistep methods
Centrum voor Wiskunde en Informatica REPORTRAPPORT Stability of implicit-explicit linear multistep methods J. Frank, W.H. Hundsdorfer and J.G. Verwer Department of Numerical Mathematics NM-R963 1996 Report
More informationLectures 18: Gauss's Remarkable Theorem II. Table of contents
Math 348 Fall 27 Lectures 8: Gauss's Remarkable Theorem II Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams.
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 informationLearning with Ensembles: How. over-tting can be useful. Anders Krogh Copenhagen, Denmark. Abstract
Published in: Advances in Neural Information Processing Systems 8, D S Touretzky, M C Mozer, and M E Hasselmo (eds.), MIT Press, Cambridge, MA, pages 190-196, 1996. Learning with Ensembles: How over-tting
More informationIntroduction 5. 1 Floating-Point Arithmetic 5. 2 The Direct Solution of Linear Algebraic Systems 11
SCIENTIFIC COMPUTING BY NUMERICAL METHODS Christina C. Christara and Kenneth R. Jackson, Computer Science Dept., University of Toronto, Toronto, Ontario, Canada, M5S 1A4. (ccc@cs.toronto.edu and krj@cs.toronto.edu)
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationParallel Methods for ODEs
Parallel Methods for ODEs Levels of parallelism There are a number of levels of parallelism that are possible within a program to numerically solve ODEs. An obvious place to start is with manual code restructuring
More informationLinear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains
Linear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 3, 3 Systems
More informationApplication of Geometric Integration to some Mechanical Problems
Application of Geometric Integration to some Mechanical Problems Kenth Engø y and Arne Marthinsen z Department of Informatics, University of Bergen, N-5 Bergen, Norway Department of Mathematical Sciences,
More informationAn average case analysis of a dierential attack. on a class of SP-networks. Distributed Systems Technology Centre, and
An average case analysis of a dierential attack on a class of SP-networks Luke O'Connor Distributed Systems Technology Centre, and Information Security Research Center, QUT Brisbane, Australia Abstract
More informationCounting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL
Counting and Constructing Minimal Spanning Trees Perrin Wright Department of Mathematics Florida State University Tallahassee, FL 32306-3027 Abstract. We revisit the minimal spanning tree problem in order
More informationNote Coveringhypercubes by isometric paths
Discrete Mathematics 240 (2001) 253 260 www.elsevier.com/locate/disc Note Coveringhypercubes by isometric paths Shannon L. Fitzpatrick a, Richard J. Nowakowski b;, Derek Holton c, Ian Caines b a Acadia
More information58 Appendix 1 fundamental inconsistent equation (1) can be obtained as a linear combination of the two equations in (2). This clearly implies that the
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationChapter Stability Robustness Introduction Last chapter showed how the Nyquist stability criterion provides conditions for the stability robustness of
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter Stability
More informationtype of high order Z. Jackiewicz, A. Marthinsen and B. Owren PREPRINT NUMERICS NO. 4/1999
NORGES TEKNISK-NATURVITENSKAPELIGE UNIVERSITET Construction of Runge-Kutta methods of Crouch-Grossman type of high order by Z. Jackiewicz, A. Marthinsen and B. Owren PREPRINT NUMERICS NO. 4/1999 NORWEGIAN
More informationChapter 7 Interconnected Systems and Feedback: Well-Posedness, Stability, and Performance 7. Introduction Feedback control is a powerful approach to o
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 7 Interconnected
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationAn exploration of matrix equilibration
An exploration of matrix equilibration Paul Liu Abstract We review three algorithms that scale the innity-norm of each row and column in a matrix to. The rst algorithm applies to unsymmetric matrices,
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 informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 15: Nonlinear optimization Prof. John Gunnar Carlsson November 1, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I November 1, 2010 1 / 24
More informationc Society for Industrial and Applied Mathematics
To appear in SIAM J. Sci. Comp. Vol.?, No.?, c Society for Industrial and Applied Mathematics EXPLOITING INVARIANTS IN THE NUMERICAL SOLUTION OF MULTIPOINT BOUNDARY VALUE PROBLEMS FOR DAE * VOLKER H. SCHULZ
More informationA Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract
A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin
More informationA Z q -Fan theorem. 1 Introduction. Frédéric Meunier December 11, 2006
A Z q -Fan theorem Frédéric Meunier December 11, 2006 Abstract In 1952, Ky Fan proved a combinatorial theorem generalizing the Borsuk-Ulam theorem stating that there is no Z 2-equivariant map from the
More informationDepartment of Applied Mathematics Preliminary Examination in Numerical Analysis August, 2013
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August, 013 August 8, 013 Solutions: 1 Root Finding (a) Let the root be x = α We subtract α from both sides of x n+1 = x
More informationA(t) L T *(t) t/t t/t
he Real Story behind Floquet-Lyapunov Factorizations RAYMOND J. SPIERI Department of Mathematics and Statistics Acadia University Wolfville, NS BP X CANADA raymond.spiteri@acadiau.ca http//ace.acadiau.ca/~rspiteri
More informationRoger Fletcher, Andreas Grothey and Sven Leyer. September 25, Abstract
omputing sparse Hessian and Jacobian approximations with optimal hereditary properties Roger Fletcher, Andreas Grothey and Sven Leyer September 5, 1995 Abstract In nonlinear optimization it is often important
More informationOrdinary Differential Equations
Chapter 7 Ordinary Differential Equations Differential equations are an extremely important tool in various science and engineering disciplines. Laws of nature are most often expressed as different equations.
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationRunge-Kutta Theory and Constraint Programming Julien Alexandre dit Sandretto Alexandre Chapoutot. Department U2IS ENSTA ParisTech SCAN Uppsala
Runge-Kutta Theory and Constraint Programming Julien Alexandre dit Sandretto Alexandre Chapoutot Department U2IS ENSTA ParisTech SCAN 2016 - Uppsala Contents Numerical integration Runge-Kutta with interval
More informationInstitute for Advanced Computer Studies. Department of Computer Science. On the Adjoint Matrix. G. W. Stewart y ABSTRACT
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{97{02 TR{3864 On the Adjoint Matrix G. W. Stewart y ABSTRACT The adjoint A A of a matrix A
More informationAppendix C Vector and matrix algebra
Appendix C Vector and matrix algebra Concepts Scalars Vectors, rows and columns, matrices Adding and subtracting vectors and matrices Multiplying them by scalars Products of vectors and matrices, scalar
More informationLinearized methods for ordinary di erential equations
Applied Mathematics and Computation 104 (1999) 109±19 www.elsevier.nl/locate/amc Linearized methods for ordinary di erential equations J.I. Ramos 1 Departamento de Lenguajes y Ciencias de la Computacion,
More informationIt is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a
Counting tableaux with row and column bounds C. Krattenthalery S. G. Mohantyz Abstract. It is well-known that the generating function for tableaux of a given skew shape with r rows where the parts in the
More informationJ.TAUSCH AND J.WHITE 1. Capacitance Extraction of 3-D Conductor Systems in. Dielectric Media with high Permittivity Ratios
JTAUSCH AND JWHITE Capacitance Extraction of -D Conductor Systems in Dielectric Media with high Permittivity Ratios Johannes Tausch and Jacob White Abstract The recent development of fast algorithms for
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 informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationENGI9496 Lecture Notes State-Space Equation Generation
ENGI9496 Lecture Notes State-Space Equation Generation. State Equations and Variables - Definitions The end goal of model formulation is to simulate a system s behaviour on a computer. A set of coherent
More informationUniversity of California Department of Mechanical Engineering ECE230A/ME243A Linear Systems Fall 1999 (B. Bamieh ) Lecture 3: Simulation/Realization 1
University of alifornia Department of Mechanical Engineering EE/ME Linear Systems Fall 999 ( amieh ) Lecture : Simulation/Realization Given an nthorder statespace description of the form _x(t) f (x(t)
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 information