(June 2, 2019 at 7:26 am)FlatAssembler Wrote:(June 1, 2019 at 1:24 pm)Smaug Wrote: I didn't really came across such problems since I had no purpose to make the algorithm optimal. The purpose of the application as a whole was to accept a Hamiltonian or a Lagrangian as a text string and form a set of DE's to be solved numerically. This operation had to be done only once at the startup of the application. After than, only numerical computation had to be carried out. The numerical computation itself did not require much precision. The end purpose was to rougly compute curves for a short span of time for certain initial conditions that had to be compared. I used C# to implement this.
I am not talking about making it efficient. I am talking about making it *work* in any programming language I know (I know nothing about C# right now).
Well, I just haven't come across that kind of a problem. Speaking of Java, I've never coded on it.