You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
It could be more efficient, maybe cache some of first zeros. But, it works. The asymptotic formula happens to land in the basin of the correct zero, even for the first zero. It then uses root finding.
The text was updated successfully, but these errors were encountered:
I mentioned it might be kinda slow because I only use root finding, use a slow root finder, don't supply derivatives, etc. But, its still 100x faster than mpmath.
In [4]: importmpmathIn [5]: %timeitmpmath.besseljzero(1.0,1)
1000loops, bestof3: 484µsperloop
Here is code to compute zeros of the besselj function. Are you interested in a PR ?
It could be more efficient, maybe cache some of first zeros. But, it works. The asymptotic formula happens to land in the basin of the correct zero, even for the first zero. It then uses root finding.
The text was updated successfully, but these errors were encountered: