Opened 2 years ago
Last modified 17 months ago
#23470 new defect
Creation of polynomials over finite fields is quite slow
Reported by: | caruso | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-8.1 |
Component: | finite rings | Keywords: | sd87, padicIMA |
Cc: | jpflori | Merged in: | |
Authors: | Reviewers: | ||
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description
On my laptop, it takes almost 1 second to create a polynomial of degree 10000 over F_125:
sage: k = GF(5^3) sage: S.<x> = k[] sage: L = [ k.random_element() for _ in range(10000) ] sage: %time f = S(L) CPU times: user 764 ms, sys: 4 ms, total: 768 ms Wall time: 767 ms
while computing its square takes only 40ms:
sage: %time g = f*f CPU times: user 32 ms, sys: 8 ms, total: 40 ms Wall time: 39.6 ms
Change History (3)
comment:1 Changed 2 years ago by
comment:2 Changed 2 years ago by
There is a lot of python overhead to do magic conversion btw different C implementations. So unless we implement special methods to go back and forth specific implementations it looks hard to tackle that one in a generic way.
comment:3 Changed 17 months ago by
- Keywords padicIMA added
Note: See
TracTickets for help on using
tickets.
This is already way too slow: