Starting algorithms for low stage order RKN methods (Q1602784): Difference between revisions

While solving second-order differential equations with Runge-Kutta-Nyström (RNK) methods, usually the computational effort is dominated by the cost of solving nonlinear systems. For this reason, it is necessary to have good starting values to begin the iterations. The authors consider a type of starting algorithms without additional computational cost. They study the general order conditions and observe that the maximum order is achieved when the Runge-Kutta-Nyström method satisfies some simplifying assumptions.