Explicit Runge-Kutta methods

Mudkavi, Vidyadhar Y and Premalatha, (2002) Explicit Runge-Kutta methods. Technical Report. National Aerospace Laboratories, Bangalore, India.

	PDF Runge-Kutta_methods.pdf Restricted to Repository staff only Download (1MB)
	Indexer Terms (Generate index codes conversion from application/pdf to indexcodes) indexcodes.txt Restricted to Repository staff only Download (7kB)

Abstract

Explicit Runge-Kutta methods are some of the most popular time stepping methods applied by scientists and engineers. They are simple to program and are self starting.13; Just the initial conditions suffice. These methods are available to different orders of accuracy, the classical fourth order method being the most popular among these.13; In spite of their popularity, most books and references do not appear to document them in full. Derivations are given mostly for the second order methods. Stability is often skipped. In this document, the explicit methods up to fourth order are derived and all known solutions are documented in such a way that it is easy to pick a desired method. A13; new set of coefficients for the fourth order method is also included. For the sake of completeness, the basics of stability are discussed and the linear stability diagrams13; are reproduced. A brief discussion from recent developments on nonlinear stability of explicit Runge-Kutta methods is also included. Implementation of the methods using C++ and an object oriented design is described. C++ templates form the basis for this design.

Item Type:	Monograph (Technical Report)
Uncontrolled Keywords:	Runge;Kutta;Time stepping;Stability;C++
Subjects:	MATHEMATICAL AND COMPUTER SCIENCES > Computer Programming and Software
Depositing User:	Mrs Manoranjitha M D
Date Deposited:	06 Oct 2006
Last Modified:	28 Aug 2015 10:22
URI:	http://nal-ir.nal.res.in/id/eprint/2913

Actions (login required)

View Item