On Fri, Mar 18, 2011 at 6:39 PM, Artyom Kazak <[email protected]> wrote: > > Hi Café! > > roots (http://hackage.haskell.org/package/roots) is a package to solve > equations like "f(x)==0". > > In RootFinder class there is an 'defaultNSteps' value, which is used as > maximal count of iterations functions like findRoot and traceRoot can make. > By default it is 250, but sometimes it's not enough. How can I use another > value instead of 250? Should I write my own RootFinder instance, or findRoot > function? >
Either choice looks like it would work fine - however using a newtype wrapper around an existing instance of FindRoot would have the least amount of code duplication, I think. I recommend contacting the maintainer of the package about getting their input, and about solving the problem in the package itself. Antoine > Thanks in advance. > — Artyom. > > _______________________________________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe > _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
