the advantage of the Milne method over the Runge-Kutta of the 4th order is a higher speed, which is provided by the fact that at one integration step for the Runge-Kutta of the 4th order it is necessary to perform the function of calculating the derivatives 4 times, and in the Milne method only 1 time.
In my implementation, the execution occurs 6 times, which ensures that the implementation will run at least 1.5 times slower than Runge-Kutta. Is there a way to fix this?
Doubts I have in this part of:
if abs(d[i+1]) < eps then y[i]:=y[i]:
end if: end do;
In theory, it is said that if the accuracy is not performed, it is necessary to reduce the step twice while it is necessary to find an intermediate reference point between the i-th and (i-1)-th.