Monografías de la Real Academia de Ciencias de Zaragoza. : 49 8, 4). Starting algorithms for partitioned Runge-Kutta methods: the pair Lobatto IIIA-IIIB I. Higueras and T. Roldán Departamento de Matemática e Informática. Universidad Pública de Navarra. 3 Pamplona, Spain. Abstract Partitioned Runge-Kutta PRK) methods are suitable for the numerical integration of separable Hamiltonian systems. For implicit PRK methods, the computational effort may be dominated by the cost of solving the non-linear systems. For these non-linear systems, good starting values minimize both the risk of a failed iteration and the effort required for convergence. In this paper we consider the Lobatto IIIA-IIIB pair. Applying the theory developed by the authors for PRK methods, we obtain optimum predictors for this pair. Numerical experiments show the efficiency of these predictors. Key words and expressions: Starting algorithms, stage value predictors, partitioned Runge-Kutta methods, Hamiltonian systems. MSC: L, L, L8, H. Introduction We consider partitioned differential equations of the form y = fy, z) yx ) = y, z = gy, z) zx ) = z, ) where f : IR l IR m IR l and g : IR l IR m IR m are sufficiently smooth functions. An example of this type of systems are Hamiltonian systems p = H q, ) q = 49 H p, 3)
where the Hamiltonian function H has the special structure Hp, q) = Tp) + V q). In this case, the Hamiltonian system )-3) is of the form p q = fq) = gp) with f = q V, g = p T. For the numerical integration of ) we consider partitioned Runge-Kutta PRK) methods. The idea of the PRK methods is to take two different Runge-Kutta RK) methods, A, b, Â,ˆb), and to treat the variables y with the first method, A, b), and the z variables with the second one, Â,ˆb). In this way, the numerical solution from t n, y n, z n ) to t n+, y n+, z n+ ) with the s-stage PRK method A, b, Â,ˆb) is given by y n+ = y n + h b t I l )fy n+, Z n+ ), z n+ = z n + h ˆb t I m )gy n+, Z n+ ), where the internal stages vectors Y n+, Z n+ are obtained from the system Y n+ = e y n + h A I l )fy n+, Z n+ ), 4) Z n+ = e z n + h  I m)gy n+, Z n+ ). ) As usual, we have denoted by the Kronecker product and by e =,..., ) t. For implicit PRK methods, the computational effort may be dominated by the cost of solving the non-linear systems 4)-). These non-linear systems are solved with an iterative method that requires starting values Y ) n+, Z ) n+, and it is well known that these values must be as accurate as possible, because in other case, the number of iterations in each step may be too high or even worse, the convergence may fail. A common way to proceed is to take as starting values the last computed numerical solution, i.e., Y ) n+ = e y n, Z ) n+ = e z n. We will refer to them as the trivial predictors. However it is also possible to involve the last computed internal stages, Y n, Z n, and the approximation y n, and consider starting algorithms of the form Y ) n+ = b y n + B I l )Y n, ) Z ) n+ = c z n + C I m )Z n, 7) where b, c IR s, B and C are s s matrices which have to be determined. Several kinds of starting algorithms for RK methods, also called stage value predictors, have been studied by different authors [], [], [4], [7], [4], [3], [], [], [], []). The
starting algorithms considered for example in [], [] or [7] are of the form )-7), whereas the ones considered for example in [], [4] or [] also involve function evaluations of the internal stages. Although in this paper we only deal with Hamiltonian systems without restrictions ODEs), we are also interested in Hamiltonian systems with restrictions DAEs). For ODE systems we can use any of the stage value predictors mentioned in the previous paragraph, but this is not the case for DAEs. Predictors involving function evaluations cannot be used for this type of systems [], [8]). This is the reason why we use predictors of the form )-7). These predictors have already been studied for PRK methods in [9]. In this paper we consider the PRK methods Lobatto IIIA-IIIB, that have been proved to be suitable ones for Hamiltonian systems [], [8]) and construct good starting algorithms for them. This is done in Section. The numerical experiments done in Section 3, show the efficiency of these starting algorithms. Starting Algorithms for Lobatto IIIA-IIIB Methods We consider the PRK methods A, b, Â,ˆb), where A, b) is the Lobatto IIIA method and Â,ˆb) is the Lobatto IIB method. We will refer to this PRK method as the Lobatto IIIA-IIB method. Observe that these methods share the same nodes, that is to say c = ĉ. Furthermore, the s-stage Lobatto IIIA method satisfies Cs), and thus Ac q = c q /q, q =,..., s; whereas the s-stage Lobatto IIIB method satisfies Cs ), and therefore Âĉ q = ĉ q /q, q =,..., s. 4 3 3 4 3 3 Figure : The pair Lobatto IIIA-IIIB for s = 3 3 4 + 4 + 3 + + 3 + +3 + + +3 4 + 4 Figure : The pair Lobatto IIIA-IIIB for s = 4
In [9] the general order conditions for predictors of the form )-7) have been obtained. Fortunately, these conditions are reduced considerably if the method PRK satisfies some simplifying assumptions, as it occurs with Lobatto IIIA-IIIB methods. For s 3, the s-stage Lobatto IIIA and IIIB methods satisfy at least C3) and C) respectively. In this case, the general order conditions in [9] for the variable y are reduced to the following ones Consistency: b + B e = e, Order : B c = e + r c, Order : B A c = eb t c + rae + rc), 8) Order 3: B Ac = eb t c + rae + rc), B AÂc = ebt Âc + raeb t c + r AÂe + rc), whereas the order conditions for the variable z are reduced to Consistency: c + C e = e, Order : C c = e + r c, Order : C  c = eˆb t c + râe + rc), 9) Order 3: C Âc = eˆb t c + râe + rc), C  c = eˆb t Âc + râeˆb t c + r  e + rc). The parameter r = h n+ /h n, where h n+ denotes the current stepsize, h n+ = t n+ t n, and h n denotes the last stepsize, h n = t n t n. For s = 3, if we take into account the number of parameters available and the number of order conditions, we get that the maximum order achieved is for both variables, y and z. It is still possible to impose one of the two conditions of order 3, but not both of them. For s 4, the s-stage Lobatto IIIA and IIIB methods satisfy at least C4) and C) respectively. Both of them satisfy b t c = ˆb t c = /. In this case, in 8) and 9) the two conditions of order 3 are equivalent. Hence for s = 4, it is possible to achieve order 3 for both variables, y and z. In order to simplify the implementation, it is interesting to initialize the variables y and z with the same coefficients. This situation corresponds to the case b = c and B = C in )-7).
In that case, for s 3, up to order, the joint order conditions 8) and 9) are reduced to the following ones Consistency: b + B e = e, Order : B c = e + r c, Order : B A c = eb t c + rae + rc), B Â c = eˆb t c + râe + rc). Now it is easy to conclude that there exists a unique joint predictor of order for the case s = 3. This predictor is given by the following coefficients r r b = r3 + r), B = r + 3r) r + r) + 3r + r ). ) r + r) r + 3r) 4r + r) + 3r + r For s 4, up to order 3, the joint order conditions 8) and 9) are reduced to the following ones Consistency: b + B e = e, Order : B c = e + r c, Order : B A c = eb t c + rae + rc), Order 3: B Ac = eb t c + rae + rc), B Âc = eˆb t c + râe + rc). We immediately obtain that for s = 4 there exists a unique joint predictor of order 3. This predictor is given by the following coefficients r 3 ) + + r + 3 3 + ) ) r + 4 + 9 r 3 b = + ) r 3 3 + ) ), ) r + 4 9 r 3 r 3 r 9 r 3 + r 3 b b b 3 b 4 B =, ) b 3 b 3 b 33 b 34 b 4 b 4 b 43 b 44 3
where b = + ) r 3 + ) r + 3 7 ) r 3, ) ) + 3 r 9 + r b = + + + ) r 3, b 3 = r + 3 ) r + ) r 3, b 4 = + 3 3 ) r + 3 ) r + ) r 3, b 3 = + + ) r + 3 + ) r b 3 = r + 3 + ) r + + ) r 3, ) ) 3 r 9 r b 33 = + b 34 = + 3 + 3 ) r + 3 + ) r + + 3 + 7 ) r 3, + ) r 3, + ) r 3, b 4 = + r + r + 4r 3, b 4 = + ) r b 43 = + ) r b 44 = + r + r + r 3. + + 3 ) r + 3 ) r + r 3, r 3, For Lobatto IIIA, the first stage of the variable y is explicit. As Y n, = y n and Y n,s = y n, in ) and )-) we get Y ) = y n, and therefore, as expected, the first stage of the variable y is not initialized. Observe that this is not the case for Lobatto IIIB method. In this case the first stage is implicit and the coefficients in ) and )-) are necessary to obtain a predictor. 3 Numerical Experiments In this section we test the predictor constructed in the previous section for the 3-stage pair Lobatto IIIA-IIIB. We have selected an academic problem and the well known restricted three-body problem. In both cases we have proceeded in the same way. The stopping criteria for the Newton iterations is Y k) Y k) TOL. 4
The problems have been integrated for different values of T OL and for different stepsizes. In Tables - we show the average number of iterations per step needed when the trivial predictor is used, and the ones when the optimum predictor given by ) is used. For each value of TOL and h, the values on the left correspond to the trivial predictor, whereas the values on the right correspond to the optimum predictor given by ). 3. Problem The problem is given by y = 4z + t) + t y) = 3) z = y t z+t) z) = The exact solution is yt) = sint + t, zt) = cost t. We have integrated this problem for t [, ]. h TOL.E-3.E-.E-7.E-./../.9 3./..E-3./../../..E-3./../../..E-3.898/../../.9 Table : Iterations per step. Problem It can be seen that except in one case, the number of iterations is lower with the predictor constructed in this paper. The exception is for h =.E-3 and TOL =.E-7 where the number of iterations coincides. We remark that in this case, the numerical solution obtained with the optimum predictor is more accurate. 3. The restricted three-body problem We have considered the restricted three-body problem from [3] x = v x x) = x y = v y y) = y z = v z z) = z v x = v y + x [ ] x+µ µ x µ + µ r 3 v r 3 x ) = v x v y = v x + y [ ] µ + µ r 3 r y 3 vy ) = v y v z = [ ] µ + µ r 3 r z 3 vz ) = v z 4)
where µ = µ, and r = x + µ ) + y + z r = x µ ) + y + z. We have integrated this problem for t [, ] with different values of the parameter µ and different initial conditions. Case I We take µ =.8 and the initial values.4,,,,, ). The numerical results are shown in Table. h TOL.E-3.E-.E-7.E-./.84.4/.3 3.9/.43.E-3.8/.3.3/.8.874/.87.E-3./..3/.49./..E-3.93/../..77/.938 Table : Iterations per step: µ =.8 Case II We take µ =.9 and the initial values.4,,,,.99,.). The numerical results are shown in Table 3. h TOL.E-3.E-.E-7.E-./..94/.4.4/.74.E-3./.3.49/.3.9/.3.E-3.4/../..9/..E-3.9/../.3.4/.37 Table 3: Iterations per step: µ =.9 Case III We take µ =.9994 and the initial values.74,,,,.43, ). The numerical results are shown in Table 4. h TOL.E-.E-7.E-9.E-./../../..E-3./../../..E-3./../../..E-3./../../. Table 4: Iterations per step: µ =.9994
In Tables -4 we again see that the number of iterations needed when we use the predictors constructed in this paper is lower than the ones needed when the trivial predictor is used. We remark that the reduction in the number of iterations when solving the non-linear systems implies a reduction in the total CPU time needed for the numerical integration, and hence it may be essential when long time integrations are done. Acknowledgments This research has been supported by the Ministerio de Ciencia y Tecnología, Project BFM-88. References [] Calvo, M., Laburta, P. and Montijano, J. I., 3: Starting algorithms for Gauss Runge-Kutta methods for Hamiltonian systems, Computers and Mathematics with Applications 4, 4 4. [] Calvo, M., Laburta, P. and Montijano, J. I., 3: Two-step high order starting values for implicit Runge-Kutta methods, Advances in Computational Mathematics 9, 4 4. [3] Calvo, M. P., : High order starting iterates for implicit Runge-Kutta methods. An improvement for variable-step symplectic integrators, IMA Journal of Numerical Analysis, 3. [4] González Pinto, S., Montijano, J. I. and Rodríguez, S. P., : On the starting algorithms for fully implicit Runge-Kutta methods, BIT 4, 8 74. [] González Pinto, S., Montijano, J. I. and Rodríguez, S. P., 3: Stabilized starting algorithms for collocation Runge-Kutta methods, Computers and Mathematics with Applications 4, 4 48. [] González Pinto, S., Montijano, J. I. and Rodríguez, S. P., 3: Variable order starting algorithms for implicit Runge-Kutta methods on stiff problems, Applied Numerical Mathematics 44, 77 94. [7] Higueras, I. and Roldán, T., : Starting algorithms for some DIRK methods, Numerical Algorithms 3, 37 39. [8] Higueras, I. and Roldán, T., 3: IRK methods for index and 3 DAEs: Starting algorithms, BIT 43, 7 9. 7
[9] Higueras, I. and Roldán, T., 3: Stage value predictors for additive Runge Kutta methods, submitted for publication. [] Jay, L., 99: Symplectic partitioned Runge-Kutta methods for constrained Hamiltonian systems, SIAM Journal on Numerical Analysis 33, 38 387. [] Jay, L., 998: Structure preservation for constrained dynamics with super partitioned additive Runge-Kutta methods, SIAM Journal on Scientific Computing, 4 44. [] Laburta, M., 997: Starting algorithms for IRK methods, Journal of Computational and Applied Mathematics 83, 9 88. [3] Murray, C. D. and Dermott S. F., 999: Solar System Dynamics, Cambridge University Press, Cambridge. [4] Olsson, H. and Söderlind, G., 999: Stage value predictors and efficient Newton iterations in implicit Runge-Kutta methods, SIAM Journal on Scientific Computing, 8. [] Roldán, T. and Higueras, I., 999: IRK methods for DAE: Starting algorithms, Journal of Computational and Applied Mathematics, 77 9. [] Sand, J., 99, Methods for starting iterations schemes for implicit Runge-Kutta formulae, Institute of Mathematical Applied Conference Series, New Series vol. 39, Oxford University Press, New York,. [7] Sanz Serna, J. and Calvo, M., 994: Numerical Hamiltonian Problems, Chapman & Hall, London. [8] Sun, G., 993: Symplectic partitioned Runge Kutta methods, Journal of Computational Mathematics, 3 37. 8