ó ʽ÷Xc@`sÜdZddlmZmZmZddlmZddlmZd„Z d„Z d„Z d„Z d „Z d „Zd ZejejejejgZd d ddgZe e e e egZdddddgZdS(s/ Parameters used in test and benchmark methods i(tdivisiontprint_functiontabsolute_import(trandom(tzeroscC`s ||dS(Ngð?((tx((s7/tmp/pip-build-7oUkmx/scipy/scipy/optimize/_tstutils.pytf1 scC`s |ddS(Nii((R((s7/tmp/pip-build-7oUkmx/scipy/scipy/optimize/_tstutils.pytf2 scC`s||d|d|dS(Ngð?g@g@((R((s7/tmp/pip-build-7oUkmx/scipy/scipy/optimize/_tstutils.pytf3scC`s4|dkrdd|S|dkr0dd|SdS(Nigð?gš™™™™™¹?gð¿i((R((s7/tmp/pip-build-7oUkmx/scipy/scipy/optimize/_tstutils.pytf4s     cC`s|dkrdd|SdS(Nigð?i((R((s7/tmp/pip-build-7oUkmx/scipy/scipy/optimize/_tstutils.pytf5s  cC`s/|dkrtƒS|dkr'tƒ SdSdS(Nii(R(R((s7/tmp/pip-build-7oUkmx/scipy/scipy/optimize/_tstutils.pytf6#s   s  f2 is a symmetric parabola, x**2 - 1 f3 is a quartic polynomial with large hump in interval f4 is step function with a discontinuity at 1 f5 is a hyperbola with vertical asymptote at 1 f6 has random values positive to left of 1, negative to right of course these are not real problems. They just test how the 'good' solvers behave in bad circumstances where bisection is really the best. A good solver should not be much worse than bisection in such circumstance, while being faster for smooth monotone sorts of functions. s cc.bisects cc.ridders cc.brenths cc.brentqRRR R R N(t__doc__t __future__RRRRtscipy.optimizeRtccRRRR R R t descriptiontbisecttriddertbrenthtbrentqtmethodstmstringst functionstfstrings(((s7/tmp/pip-build-7oUkmx/scipy/scipy/optimize/_tstutils.pyts