Highly continuous interpolants for one-step ode solvers and their application to runge-kutta methods

Papakostas, SN; Tsitouras, Ch

dc.contributor.author	Papakostas, SN	en
dc.contributor.author	Tsitouras, Ch	en
dc.date.accessioned	2014-03-01T01:12:58Z
dc.date.available	2014-03-01T01:12:58Z
dc.date.issued	1997	en
dc.identifier.issn	0036-1429	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12304
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0001456693&partnerID=40&md5=bf9d68ab01055ca4250f9aa04fe24d01	en
dc.subject	BDF formulas	en
dc.subject	General linear methods	en
dc.subject	Initial value problems	en
dc.subject	Interpolants	en
dc.subject	ODE solvers	en
dc.subject	One-step methods	en
dc.subject	Runge-kutta pairs	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	ORDINARY DIFFERENTIAL EQUATIONS	en
dc.subject.other	STABILITY	en
dc.subject.other	FORMULAS	en
dc.subject.other	ALGORITHMS	en
dc.subject.other	5TH-ORDER	en
dc.title	Highly continuous interpolants for one-step ode solvers and their application to runge-kutta methods	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1997	en
heal.abstract	We suggest a general method for the construction of highly continuous interpolants for one-step methods applied to the numerical solution of initial value problems of ODEs of arbitrary order. For the construction of these interpolants one uses, along with the numerical data of the discrete solution of a problem provided by a typical one-step method at endstep points, high-order derivative approximations of this solution. This approach has two main advantages. It allows an easy way of construction of high-order Runge-Kutta and Nystrom interpolants with reduced cost in additional function evaluations that also preserve the one-step nature of the underlying discrete ODE solver. Moreover, for problems which are known to possess a solution of high smoothness, the approximating interpolant resembles this characteristic, a property that on occasion might be desirable. An analysis of the stability behavior of such interpolatory processes is carried out in the general case. A new numerical technique concerning the accurate determination of the stability behavior of numerical schemes involving higher order derivatives and/or approximations of the solution from previous grid-points over nonequidistant meshes is presented. This technique actually turns out to be of a wider interest, as it allows us to infer, in certain cases, more accurate results concerning the stability of, for example, the BDF formulas over variable stepsize grids. Moreover it may be used as a framework for analyzing more complex (and supposedly more promising) types of methods, as they are the general linear methods for first- and second-order differential equations. Many particular variants of the new method for first-order differential equations that have good prospects of finding a practical implementation are fully analyzed with respect to their stability characteristics. A detailed application concerning the construction of C2 and C3 continuous extensions for some fifth-and sixth-order Runge-Kutta pairs, supplemented by a detailed study of the local truncation error characteristics of a class of interpolants of this type, is also provided. Various numerical examples show, in these cases, several advantages of the newly proposed technique with respect to function evaluation cost and global error behavior, in comparison with others currently in use.	en
heal.publisher	SIAM PUBLICATIONS	en
heal.journalName	SIAM Journal on Numerical Analysis	en
dc.identifier.isi	ISI:A1997WJ16900002	en
dc.identifier.volume	34	en
dc.identifier.issue	1	en
dc.identifier.spage	22	en
dc.identifier.epage	47	en