#9492: add computation of swinnerton-dyer polynomials to sage
---------------------------+------------------------------------------------
Reporter: was | Owner: jason
Type: enhancement | Status: new
Priority: minor | Milestone: sage-4.5.1
Component: misc | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
---------------------------+------------------------------------------------
Changes (by mstreng):
* cc: mstreng (added)
Comment:
I just adapted sdpoly3 to use a binary tree. The result is called sdpoly5,
see file sd2.sage. I found sdpoly5 to be slightly faster than sdpoly3 in
the tests that I have run.
When using naive polynomial multiplication, the algorithms sdpoly3 and
sdpoly5 are asymptotically equivalent. As soon as FFT quasi-linear
polynomial multiplication is implemented for interval arithmetic and
examples become large, the algorithm sdpoly5 should be the faster one
(quasi-linear).
{{{
sage: time sdpoly5(12)
CPU times: user 845.82 s, sys: 0.10 s, total: 845.92 s
Wall time: 846.13 s
sage: time sdpoly3(12)
CPU times: user 861.84 s, sys: 0.01 s, total: 861.85 s
Wall time: 861.98 s
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9492#comment:4>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
