Ask Your Question

find_root does not fulfill tolerance

asked 2017-02-09 17:44:53 +0200

franpena gravatar image

updated 2017-02-10 16:54:09 +0200

In Sage 7.3 the result of:




One would expect that the error with the exact solution (x=0) would be lower than 1e-13. I imagine that the multiplicity of the root produces this effect. Does somebody know the numerical algorithm behind find_root?

Thanks in advance.

UPDATE: Thanks to @kcrisman, I see that find_root calls brentq. The documentation of such function says:

Safer algorithms are brentq, brenth, ridder, and bisect, but they all require that the root first be bracketed in an interval where the function changes sign. The brentq algorithm is recommended for general use in one dimensional problems when such an interval has been found.

Since 4x^4-x^2 has a root in 0 with multiplicity 2, this condition is not fulfilled. Is there any other command in Sage different from find_root to numerically calculate roots for general functions that can handle with roots with multiplicity bigger than 1?

edit retag flag offensive close merge delete

1 Answer

Sort by ยป oldest newest most voted

answered 2017-02-09 19:07:26 +0200

kcrisman gravatar image

If you do find_root?? you will see that the final line of code is a Scipy algorithm:

return scipy.optimize.brentq(f, a, b,
                             full_output=full_output, xtol=xtol, rtol=rtol, maxiter=maxiter)

The Scipy doc indicates it should indeed return within the tolerance expected, so I'm not sure what is going on, but at least this is where you should start your search.

edit flag offensive delete link more


brentq requires a sign change of $f$ in the given interval, but this cannot be achieved in $[-0.25, 0.4]$ (note that $f$ is tangent to $y=0$ at $0$). Maybe that's the reason?

mforets gravatar imagemforets ( 2017-02-09 20:08:04 +0200 )edit

Maybe - I see what you mean here. But some experimentation with some perturbations of your example don't give me confidence, since it doesn't satisfy its own documentation -

kcrisman gravatar imagekcrisman ( 2017-02-09 21:36:28 +0200 )edit

..still i think this is a border case, because the root cannot be properly "enclosed". For completeness: it is also possible to do R.<x> = RDF[], f = 4*x^4 - x^2, f.roots().

mforets gravatar imagemforets ( 2017-02-09 22:59:37 +0200 )edit

Hmm, but RDF doesn't even do more than a certain tolerance. Maybe it only supports tol up to a certain point?

kcrisman gravatar imagekcrisman ( 2017-02-09 23:53:34 +0200 )edit

@kcrisman Yes, I think that's the case; some experiments with the function 4*x^4-x^2+0.01 around the exact root -1/2*sqrt(-1/10*sqrt(21) + 1/2) (this time in $[-0.25, 0.0]$) show it works ok until rtol is too small, giving ValueError: rtol too small (1e-16 < 4.44089e-16). But alternatively for the OP's question, let us now that using Newton's method, as in newton(4*x^4-x^2, -0.25, tol=1e-14, maxiter=3000), it will pass the tests with 1e-13 (and smaller).

mforets gravatar imagemforets ( 2017-02-12 19:49:49 +0200 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower


Asked: 2017-02-09 17:44:53 +0200

Seen: 384 times

Last updated: Feb 10 '17