On Thu, 2016-11-10 at 18:54, Joaquim Masset Lacombe Dias Garcia <joaquimdgar...@gmail.com> wrote: > I am running a sequence of root finding functions in a loop. > For my problem the basic fzero always work. > > However, using Newtons method is very useful because it is very fast when > it converges. > The problem is that when it does not converge it throws an error instead of > a non-convergence flag. > > That way I cant use the fzero when newton fails (actually try/catch works > but its very slow). > > Any suggestions?
Just modify the Roots.jl package.
