arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0211049math.NAcs.NA
收藏

Runge-Kutta方法、树与Mathematica

Runge-Kutta methods, trees, and Mathematica

Folkmar Bornemann

AI总结:

本文用递归定义的有根树给出了Runge-Kutta方法阶条件Butcher定理的初等证明,并展示了在Mathematica中的简洁实现及示例应用。

摘要:

本文给出了Butcher定理关于Runge-Kutta方法阶条件的简单且初等的证明。该证明基于有根树的递归定义,避免了标记和Faa di Bruno公式等组合工具。这种严格的递归方法可以轻松且优雅地使用现代计算机代数系统(如Mathematica)实现。文中包含了完整但简短的源代码,并将其应用于一些具有启发性的示例。

英文摘要:

A simple and elementary proof of Butcher's theorem on the order conditions of Runge-Kutta methods is presented. It is based on a recursive definition of rooted trees and avoids combinatorial tools such as labelings and Faa di Bruno's formula. This strictly recursive approach can easily and elegantly be implemented using modern computer algrebra systems like Mathematica. The full but short source code is included and applied to some instructive examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑