Explicit Runge–Kutta methods for starting integration of Lane–Emden problem

作者:

Highlights:

摘要

Traditionally, when constructing explicit Runge–Kutta methods we demand the satisfaction of the trivial simplifying assumption. Thus, f1=f(x0,y0) is always used as the first stage of these methods when applied to the Initial Value Problem (IVP): y′(x)=f(x,y), y(x0)=y0. Here we examine the case with f1=f(x0+c1h,y0),(h: the step) and c1 ≠ 0. We derive the order conditions for arbitrary order and construct a 5th order method at the standard cost of six stages per step. This method is found to outperform other classical Runge–Kutta pairs with orders 5(4) when applied to problems with singularity at the beginning (e.g. Lane–Emden problem).

论文关键词:Runge–Kutta,5th order,Row simplifying assumptions,Rooted trees,2-colored leaves,Lane–Emden problem

论文评审过程:Received 19 January 2019, Accepted 17 February 2019, Available online 4 March 2019, Version of Record 4 March 2019.

论文官网地址:https://doi.org/10.1016/j.amc.2019.02.047