Cheap error estimation for Runge-Kutta methods

Tsitouras, Ch; Papakostas, SN

dc.contributor.author	Tsitouras, Ch	en
dc.contributor.author	Papakostas, SN	en
dc.date.accessioned	2014-03-01T01:14:27Z
dc.date.available	2014-03-01T01:14:27Z
dc.date.issued	1999	en
dc.identifier.issn	1064-8275	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13075
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0033294722&partnerID=40&md5=c0b14b2898825e6bab99ea24312c569f	en
dc.subject	initial value problems	en
dc.subject	ODE solvers	en
dc.subject	one-step methods	en
dc.subject	Runge-Kutta pairs	en
dc.subject	step-size change control algorithm	en
dc.subject	tolerance proportionality	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	One step method	en
dc.subject.other	Runge-Kutta pairs	en
dc.subject.other	Stepsize change control algorithm	en
dc.subject.other	Tolerance proportionality	en
dc.subject.other	Algorithms	en
dc.subject.other	Error analysis	en
dc.subject.other	Extrapolation	en
dc.subject.other	Function evaluation	en
dc.subject.other	Initial value problems	en
dc.subject.other	Ordinary differential equations	en
dc.subject.other	Problem solving	en
dc.subject.other	Runge Kutta methods	en
dc.title	Cheap error estimation for Runge-Kutta methods	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	Explicit Runge-Kutta (RK) methods in the form of pairs of orders p (p - 1) provide an attractive means for the solution of initial value problems of first-order differential equations. Most existing RK formulas (single methods as well as pairs) use the minimal number of stages required for achieving a prescribed order. In this article we shall study, in terms of efficiency and reliability, RK pairs of orders p (q), whenever q < p - 1. While in practice pairs of orders p (p - 1) usually require one or two more stages in addition to those already necessary for a pth-order single method, we show here that if p = 6, 7, 8, or 10, then efficient pairs of orders p (p - 2), p (p - 3), or p (p - 4) may be easily constructed with a reduced cost in function evaluations with respect to pairs of orders p (p - 1). In general comparing p (q) pairs used in local extrapolation mode (LEM-the one most frequent in practice), we see that while the propagated solution of a problem is, in either case, of the same order p, pairs characterized by q < p - 1 use fewer function evaluations. Consequently they might be more efficient, provided that they are accompanied by a reliable estimator, and an efficient implementation could be found for their application in practical situations. A new step-size selection algorithm proposed here takes full advantage of the potential for increased efficiency inherited by pairs that are accompanied by no-additional-cost estimators. This algorithm, which may be also applied to Nystrom pairs, makes code implementation of these pairs attractive, as in all cases the proportionality of the global error with respect to the requested tolerance is in practice always achieved. Here we shall cover the cases of pairs of orders 4(2), 6(4), 7(5), 8(6), 8(5), 8(4), and 10(6) with nearly minimized truncation error coefficients which use a minimal number of stages (i.e., in almost all cases equal to that currently known to be the minimal required for constructing a single method of order equal to that of the higher-order method of the pair). By studying the numerical performance of these pairs we may see that not only are these pairs as reliable as the respective pairs of the type p (p - 1), but in all cases they seem to be more efficient. Another important consequence of the numerical tests performed here is that they suggest that for a given number of stages the best RK pairs that may be attained are those for which the higher-order method is of the maximal possible order.	en
heal.publisher	SIAM PUBLICATIONS	en
heal.journalName	SIAM Journal on Scientific Computing	en
dc.identifier.isi	ISI:000081809900008	en
dc.identifier.volume	20	en
dc.identifier.issue	6	en
dc.identifier.spage	2067	en
dc.identifier.epage	2088	en