Skip to main content
Log in

DESIRE: diagonally extended singly implicit Runge–Kutta effective order methods

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

To overcome known disadvantages in the use of singly-implicit methods in the solution of stiff differential equations, two generalizations have been recently introduced. These are the use of additional diagonally-implicit stages and the use of effective order as a weakening of the conditions on the method. In this paper, these two generalizations are combined into a unified scheme. The resulting DESIRE methods are very promising alternatives to standard methods for solving stiff problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Alexander, Diagonally implicit Runge–Kutta methods for stiff ODEs, SIAM J. Numer. Anal. 14 (1977) 1006–1021.

    Article  MATH  MathSciNet  Google Scholar 

  2. K. Burrage, A special family of Runge–Kutta methods for solving stiff differential equations, BIT 18 (1978) 22–41.

    Article  MATH  MathSciNet  Google Scholar 

  3. K. Burrage, J.C. Butcher and F.H. Chipman, An implementation of singly-implicit Runge–Kutta methods, BIT 20 (1980) 326–340.

    Article  MATH  MathSciNet  Google Scholar 

  4. J.C. Butcher, The effective order of Runge–Kutta methods, in: Conference on the Numerical Solution of Differential Equations, Dundee (Springer, Berlin, 1969) pp. 133–139.

    Google Scholar 

  5. J.C. Butcher, On the implementation of implicit Runge–Kutta methods, BIT 16 (1976) 237–240.

    Article  MATH  MathSciNet  Google Scholar 

  6. J.C. Butcher, A transformed implicit Runge–Kutta method, J. Assoc. Comput. Mach. 26 (1979) 731–738.

    MATH  MathSciNet  Google Scholar 

  7. J.C. Butcher, Towards efficient implementation of singly-implicit methods, ACM Trans. Math. Software 14 (1988) 68–75.

    Article  MATH  MathSciNet  Google Scholar 

  8. J.C. Butcher and J.R. Cash, Towards efficient Runge–Kutta methods for stiff systems, SIAM J. Numer. Anal. 27 (1990) 753–761.

    Article  MATH  MathSciNet  Google Scholar 

  9. J.C. Butcher, J.R. Cash and M.T. Diamantakis, DESI methods for stiff initial value problems, ACM Trans. Math. Software 22 (1996) 401–422.

    Article  MATH  MathSciNet  Google Scholar 

  10. J.C. Butcher and P. Chartier, A generalization of singly-implicit Runge–Kutta methods, Volterra centennial, Tempe, AZ (1996), Appl. Numer. Math. 24 (1997) 343–350.

    Article  MATH  MathSciNet  Google Scholar 

  11. J.C. Butcher and P. Chartier, The effective order of singly-implicit Runge–Kutta methods, in preparation.

  12. J.C. Butcher and D.J.L. Chen, ESIRK methods and variable stepsize, in preparation.

  13. J.R. Cash and M.T. Diamantakis, On the implementation of block Runge–Kutta methods for stiff IVPs, in: Scientific Computation and Differential Equations, Auckland (1993), Ann. Numer. Math. 1 (1994) 385–398.

  14. M.T. Diamantakis, Diagonally extended singly implicit Runge–Kutta methods for stiff initial value problems, Ph.D. thesis, Imperial College, University of London, UK (1995).

    Google Scholar 

  15. M.T. Diamantakis, The NUMOL solution of time-dependent PDEs using DESI Runge–Kutta formulae, in: Numerical Methods for Ordinary Differential Equations, Atlanta, GA (1994), Appl. Numer. Math. 17 (1995) 235–249.

  16. E. Hairer and G. Wanner, Solving Ordinary Differential Equations II.Stiff and Differential Algebraic Problems, Springer Series in Computational Mathematics 14 (Springer, Berlin, 2nd ed.,1996).

    Google Scholar 

  17. P. Kaps, Rosenbrock-type methods, in: Proceedings on Numerical Methods for Stiff Initial Value Problems, eds. G. Dalhquist and R. Jeltschs, Oberwolfach, Germany (Institut für Geometrie und Praktische Mathematik, RWTH Aachen, 1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Butcher, J., Diamantakis, M. DESIRE: diagonally extended singly implicit Runge–Kutta effective order methods. Numerical Algorithms 17, 121–145 (1998). https://doi.org/10.1023/A:1011623226983

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011623226983

Navigation