On 26 February 2016 at 09:42, FRIGN <d...@frign.de> wrote: > On Fri, 26 Feb 2016 09:18:20 +0100 > Anselm R Garbe <garb...@gmail.com> wrote: > I agree with you, but sadly with numerical algorithms, the case is a > different (it's my area of work).
I know. > Implementing an Euler-iteration for first order separable ODE's is the > simplest way you can go, however, it comes at a high cost. > Using a sophisticated Runge-Kutta-Fehlerberg-iteration is a whole other > story and you end up with much much better results in less time. Sure. My believe wrt. numerical algorithms is though, that there *are* be equally efficient algorithms with less complexity. The problem though is, that so far human intelligence wasn't able to determine them. Perhaps some other Einstein will appear and simplify them ;) -Anselm
