James Cook schrieb: > Those are both options, as is to simply restart findRoot if it returns > a 'Left' vaule. I personally would incline toward a custom driver > function (findRoot). I should probably add one to the library that > accepts a step limit and/or one that just iterates until convergence.
I thought that the mosts Haskellish way to do numerical iterations is to generate a list of successive approximations (by List.iterate, of course) and then let the user choose where and why he wants to abort the list, and thus the iteration. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
