Symbolic derivation of Runge-Kutta order conditions

Famelis, ITh; Papakostas, SN; Tsitouras, Ch

dc.contributor.author	Famelis, ITh	en
dc.contributor.author	Papakostas, SN	en
dc.contributor.author	Tsitouras, Ch	en
dc.date.accessioned	2014-03-01T01:21:35Z
dc.date.available	2014-03-01T01:21:35Z
dc.date.issued	2004	en
dc.identifier.issn	0747-7171	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/16264
dc.subject	Combinatorial mathematics	en
dc.subject	Partitions	en
dc.subject	Rooted trees	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	PAIRS	en
dc.title	Symbolic derivation of Runge-Kutta order conditions	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.jsc.2003.07.001	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.jsc.2003.07.001	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	Tree theory, partitions of integer numbers, combinatorial mathematics and computer algebra are the basis for the construction of a powerful and efficient symbolic package for the derivation of Runge-Kutta order conditions and principal truncation error terms. (C) 2003 Elsevier Ltd. All rights reserved.	en
heal.publisher	ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD	en
heal.journalName	Journal of Symbolic Computation	en
dc.identifier.doi	10.1016/j.jsc.2003.07.001	en
dc.identifier.isi	ISI:000189324700003	en
dc.identifier.volume	37	en
dc.identifier.issue	3	en
dc.identifier.spage	311	en
dc.identifier.epage	327	en