- #1
- 2,845
- 0
I'm looking for a tool to solve a problem I've been working on. In particular, I want something that implements subquadratic trig functions -- actually just the tangent would work for me. :) I've been using Pari, but its tangent routine seems to be [itex]\mathcal{O}(n^2)[/itex] or [itex]\mathcal{O}(n^2\log n)[/itex] based on timing, and for high precision this simply takes too long. 10,000 digits in Pari takes half a second, but 100,000 takes more than a minute, and ten million takes over a week, which isn't feasible.
Any suggestions? Can anyone test their preferred platform (Math'ca, Maple, etc.) to see how long these take? I was testing tan(1) if you want comparability. I tested Maxima, but it seemed to be inappropriate for the task: in addition to apparently also using a quadratic method, it took ~30 times longer than Pari for similar precisions.
Any suggestions? Can anyone test their preferred platform (Math'ca, Maple, etc.) to see how long these take? I was testing tan(1) if you want comparability. I tested Maxima, but it seemed to be inappropriate for the task: in addition to apparently also using a quadratic method, it took ~30 times longer than Pari for similar precisions.
Last edited: