Opened 11 years ago
Last modified 7 years ago
#9492 new enhancement
add computation of swinnerton-dyer polynomials to sage
Reported by: | was | Owned by: | jason |
---|---|---|---|
Priority: | minor | Milestone: | sage-6.4 |
Component: | misc | Keywords: | |
Cc: | mstreng | Merged in: | |
Authors: | Reviewers: | ||
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description (last modified by )
Magma has 'em, so we should to:
Sympy has them:
http://github.com/mattpap/sympy-polys/commit/dc42fd1995c48ad426b6279d3d1914f74e0c3296
This page has a Mathematica notebook with a function that computes them:
http://mathworld.wolfram.com/Swinnerton-DyerPolynomial.html
I tried it in Mathematica 7, and it is massively, dramatically *SLOW* compared to Magma. For comparison, the 5th one takes 55 seconds in Mathematica, and in Magma it takes... 0.02 seconds.
n time in seconds with Magma 2.15.11 on my macbook air ---------------- 5 | 0.02 6 | 0.18 7 | 6.68 8 | 99.99
Attachments (2)
Change History (14)
comment:1 Changed 11 years ago by
- Description modified (diff)
comment:2 Changed 11 years ago by
See also http://wiki.sagemath.org/days23/CodingProjects
In the attached file sd.sage, I implemented a few functions, and also copied in Jeroen Demeyer's p-adic function. I think the interval arithmetic one (sdpoly3) is considerably faster than the p-adic one, and moreover sdpoly3 is provably correct. It simply computes the poly using intervals until there is a unique integer in each interval. So I think it should just be SAge-library-ified and put into sage... somewhere.
Changed 11 years ago by
comment:3 Changed 11 years ago by
I think these are interesting because they are used in benchmarks for factoring and irreducibility testing. See
The sdpoly3 function computes the 10th Swinnerton-Dyer poly of degree 2^{10=1024 in < 20 seconds. }
sage: time c = sdpoly3(10) CPU times: user 17.02 s, sys: 0.05 s, total: 17.07 s Wall time: 17.50 s
Changed 11 years ago by
comment:4 Changed 11 years ago by
- Cc mstreng added
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
comment:5 Changed 11 years ago by
I just adapted sdpoly3 to use a binary tree.
Thanks. But just a remark -- the Sage prod command already uses a binary tree, at least if the input is a list or of length < 1000. See the file
devel/sage/sage/misc/misc_c.pyx
which Robert Bradshaw wrote. So putting
prod(list( ... ))
instead of
prod( ...)
in sdpoly3 might be another approach.
comment:6 Changed 11 years ago by
I'm at a Singular conference, so I decided to try this problem using Singular polynomial quotient rings. It's pretty good, though it doesn't beat interval arithmetic speed-wise.
def sdpoly6(n): R = PolynomialRing(QQ,n+1,names='x') x = R.gens() v = primes_first_n(n) I = R.ideal([ x[i]^2-v[i] for i in range(len(v)) ]) S = R.quotient(I) x = S.gens() C = cartesian_product_iterator([[-1,1]]*n) f = prod([ x[-1] + sum(s[i]*x[i] for i in range(n)) for s in C]) return f
Some timings:
sage: time a = sdpoly6(8) Time: CPU 0.71 s, Wall: 0.71 s sage: time a = sdpoly6(9) Time: CPU 3.44 s, Wall: 3.47 s sage: time a10 = sdpoly6(10) Time: CPU 29.03 s, Wall: 29.19 s
Very impressive for something non-numerical, IMHO...
comment:7 Changed 8 years ago by
FLINT now includes a function that computes the nth Swinnerton-Dyer polynomial. It could be wrapped trivially.
comment:8 Changed 8 years ago by
- Milestone changed from sage-5.11 to sage-5.12
comment:9 Changed 7 years ago by
- Milestone changed from sage-6.1 to sage-6.2
comment:10 Changed 7 years ago by
I have tried to wrap the flint function, but was not able to. Could someone more versed into interfaces do that ?
comment:11 Changed 7 years ago by
- Milestone changed from sage-6.2 to sage-6.3
comment:12 Changed 7 years ago by
- Milestone changed from sage-6.3 to sage-6.4
OK, I just wrote some Sage code from scratch that provably computes the swinnerton-dyer polynomials vastly more quickly than Magma or Mathematica.