Diagonally Implicit Runge–Kutta Methods for Stiff O.D.E.’s
Author:
- Roger AlexanderRARoger Alexander
- 1 December 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 14 (6) , 1006-1021
Abstract
To be A-stable, and possibly useful for stiff systems, a Runge–Kutta formula must be implicit. There is a significant computational advantage in diagonally implicit formulae, whose coefficient matrix is lower triangular with all diagonal elements equal. We derive new, strongly S-stable diagonally implicit Runge–Kutta formulae of order 2 in 2 stages and of order 3 in 3 stages, and show that it is impossible for a strongly S-stable diagonally implicit method to attain order 4 in 4 stages. Merely A-stable diagonally implicit formulae, of order 3 in 2 stages and of order 4 in 3 stages, were previously known; we prove that no 4-stage method of this type has order 5. We describe a computer program for stiff differential equations which uses these methods, and compare them to each other and to the GEAR package.Keywords
This publication has 7 references indexed in Scilit:
- Comparing numerical methods for stiff systems of O.D.E:sBIT Numerical Mathematics, 1975
- On the stability and accuracy of one-step methods for solving stiff systems of ordinary differential equationsMathematics of Computation, 1974
- Analysis of Discretization Methods for Ordinary Differential Equations1973
- An algebraic theory of integration methodsMathematics of Computation, 1972
- Implicit Runge-Kutta processesMathematics of Computation, 1964
- Integration processes based on Radau quadrature formulasMathematics of Computation, 1964
- Coefficients for the study of Runge-Kutta integration processesJournal of the Australian Mathematical Society, 1963