Abstract
A code based on the two-stage Gauss formula (order four) for second-order initial value problems of a special type is developed. This code can be used to obtain a low- to medium-precision integration for a wide range of problems in the class of oscillatory type, Hamiltonian problems, and time-dependent partial differential equations discretized in space by finite differences or finite elements. The iteration process used in solving for the stage values of the Gauss formula, the selection of the initial step size, and the choice of an appropriate local error estimator for determining the step size change according to a particular tolerance specified by the user are studied. Moreover, a global error estimate and a dense output at equidistant points in the integration interval are supplied with the code. Numerical experiments and some comparisons with certain standard codes on relevant test problems are also given.
- }}Addison, C. A. 1984. A comparison of several formulas on lightly damped, oscillatory problems. SIAM J. Sci. Statist. Comput. 5, 4, 920--936.Google ScholarDigital Library
- }}Bickart, T. A. 1977. An efficient solution process for implicit Runge-Kutta methods. SIAM J. Numer. Anal. 14, 1022--1027.Google ScholarDigital Library
- }}Brankin, R., Gladwell, I., Dormand, J., Prince, P., and Seward, W. 1989. Algorithm 670. A Runge-Kutta-Nyström. ACM Trans. Math. Softw. 15, 31--40. Google ScholarDigital Library
- }}Brown, P., Byrne, G., and Hindmarsh, A. 1989. Vode: A variable-coefficient ode solver. SIAM J. Sci. Statist. Comput. 10, 1038--1051. Google ScholarDigital Library
- }}Calvo, M., González-Pinto, S., and Montijano, J. 2008. Global error estimation based on the tolerance proportionality for some adaptive Runge-Kutta codes. J. Comput. Appl. Math. 218, 329--341. Google ScholarDigital Library
- }}Cash, J. 2005. A variable step Runge-Kutta Nyström integrator for reversible systems of second order initial value problems. Siam J. Sci. Comp. 26, 3, 963--978. Google ScholarDigital Library
- }}Cooper, G. and Butcher, J. An iteration scheme for implicit Runge-Kutta methods. IMA J. Numer. Anal. 3.Google Scholar
- }}Cooper, G. and Vignesvaran, R. 1990. A scheme for the implementation of implicit Runge-Kutta methods. Comput. 45, 321--332. Google ScholarDigital Library
- }}Enright, W. 1978. Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations. ACM Trans. Math. Softw. 4, 127--136. Google ScholarDigital Library
- }}Enright, W. 1980. On the efficient time integration of systems of second order equations arising on structural dynamics. Intern. J. Num. Meth. Engin. 16, 13--18.Google ScholarCross Ref
- }}Fehlberg, E., Filippi, S., and Graf, J. 1986. Ein Runge-Kutta-Nyström-Formelpaar der Ordnung 10(11) für Differentialgleichur-gen der Form y. ZAMM 66, 7, 265--270.Google ScholarCross Ref
- }}Fermi, E., Pasta, J., and Ulam, S. 1974. Los alamos report no. la-1940 (1965). Lect. Appli. Math. 15, 143.Google Scholar
- }}Filippi, S. and Graf, J. 1986. New Runge-Kutta-Nyström formula-pairs of order 8(7), 9(8), 10(9), and 11(10) for differential equations of the form y = f(x,y). J. Comput. Appl. Math. 14, 361--370. Google ScholarDigital Library
- }}Franco, J., Gomez, J. M., and Randez, L. 1997. Sdirk methods for odes with oscillating solutions. J. Comput. Appl. Math. 81, 197--209. Google ScholarDigital Library
- }}Gladwell, I. and Thomas, R. 1990. Efficiency of methods for second--order problems. IMA J. Numer. Anal. 10, 181--207.Google ScholarCross Ref
- }}González-Pinto, S., Montijano, J., and Rández, L. 1995. Iterative schemes for three stage implicit Runge-Kutta methods. Appl. Numer. Math. 17, 363--382. Google ScholarDigital Library
- }}Gonzalez-Pinto, S., Pérez-Rodrí guez, S., and Rojas-Bello, R. 2009. Gauss2 a fortran 90 code for second order initial value problems. http://pcmap.unizar.es/numerico/software.php.Google Scholar
- }}González-Pinto, S., Peréz-Rodrí guez, S., and Rojas-Bello, R. 2006. Efficient iteration for gauss methods on second order problems. J. Comput. Appl. Math. 189, 80--97. Google ScholarDigital Library
- }}Hairer, E., Lubich, C., and Wanner, G. 2002. Geometric Numerical Integration. Springer, Berlin.Google Scholar
- }}Hairer, E., Nørsett, S., and Wanner, G. 1993. Solving Ordinary Differential Equations I, Nonstiff Problems. Springer, Berlin. Google ScholarDigital Library
- }}Hairer, E. and Wanner, G. 1996. Solving Ordinary Differential Equations II. Springer, Berlin.Google Scholar
- }}Lambert, J. and Watson, I. Symmetric multistep methods for periodic initial value problems. J. Inst. Math. Appl. 18, 189--202.Google Scholar
- }}Sanz-Serna, J. and Calvo, M. Numerical Hamiltonian Problems. Chapman & Hall, London.Google Scholar
- }}Shampine, L. and Baca, L. 1984. Error estimators for stiff differential equations. J. Comput. Appl. Math. 11, 197--207.Google ScholarCross Ref
- }}van der Houwen, P. and Messina, E. 1997. Parallel linear system solvers for Runge-Kutta-Nyström. J. Comput. Appl. Math. 82, 407--422. Google ScholarDigital Library
- }}van der Houwen, P. and Sommeijer, B. 1989. Diagonally implicit Runge-Kutta-Nyström. SIAM J. Numer. Anal. 26, 2, 414--429. Google ScholarDigital Library
- }}Varah, J. 1979. On the efficient implementation of implicit Runge-Kutta methods. Math. Comput. 33, 557--561.Google ScholarCross Ref
Index Terms
- A Code Based on the Two-Stage Runge-Kutta Gauss Formula for Second-Order Initial Value Problems
Recommendations
Symplectic exponentially-fitted four-stage Runge---Kutta methods of the Gauss type
The construction of symmetric and symplectic exponentially-fitted Runge---Kutta methods for the numerical integration of Hamiltonian systems with oscillatory solutions deserves a lot of interest. In previous papers fourth-order and sixth-order ...
Mono-implicit Runge-Kutta formulae for the numerical solution of second order nonlinear two-point boundary value problems
Mono-implicit Runge-Kutta (MIRK) formulae are widely used for the numerical solution of first order systems of nonlinear two-point boundary value problems. In order to avoid costly matrix multiplications, MIRK formulae are usually implemented in a ...
Two-derivative Runge-Kutta-Nyström methods for second-order ordinary differential equations
Classical Runge-Kutta-Nyström (RKN) methods for second-order ordinary differential equations are extended to two-derivative Runge-Kutta-Nyström (TDRKN) methods involving the third derivative of the solution. A new version of Nyström tree theory and the ...
Comments