Symbolic derivation of Runge-Kutta order conditions

Authors:
I. Th. Famelis;S. N. Papakostas;Ch. Tsitouras
Affiliations:
Department of Mathematics, Faculty of Applied Mathematics and Physical Sciences, National Technical University of Athens, Zografou Campus, GR15780 Athens, Greece;Hegemo SA, 369 Sigrou Avenue, GR17654 Athens, Greece;Department of Applied Sciences, TEI of Chalkis, GR 34400 Psahna, Greece
Venue:
Journal of Symbolic Computation
Year:
2004

Citing 6
Cited 3

Symbolic derivation of Runge-Kutta methods

Journal of Symbolic Computation
A new recurrence for computing Runge-Kutta truncation error coefficients

SIAM Journal on Numerical Analysis
A general family of explicit Runge-Kutta pairs of orders 6(5)

SIAM Journal on Numerical Analysis
Cheap Error Estimation for Runge--Kutta Methods

SIAM Journal on Scientific Computing
High Phase-Lag-Order Runge--Kutta and Nyström Pairs

SIAM Journal on Scientific Computing
Optimized explicit Runge-Kutta pair of orders 9(8)

Applied Numerical Mathematics

A Matlab package for automatically generating Runge-Kutta trees, order conditions, and truncation error coefficients

ACM Transactions on Mathematical Software (TOMS)
Symbolic derivation of order conditions for hybrid Numerov-type methods solving y˝=f(x,y)

Journal of Computational and Applied Mathematics
Global optimization for algebraic geometry --- computing runge---kutta methods

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

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.