#6583: Implement two descent over QQ natively in Sage using ratpoints
-------------------------------+--------------------------------------------
Reporter: rlm | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3
Component: elliptic curves | Keywords:
Work_issues: | Author: Robert Miller
Upstream: N/A | Reviewer:
Merged: |
-------------------------------+--------------------------------------------
Comment(by cremona):
Sorry, I did not mean to sound so critical. Of course this should be
included. I have not had time to look at it in detail (though I feel that
people expect me to, and give an expert opinion). I think it would be
good to have native 2-descent code in Sage (another extremely useful
project would be to rewrite Simon's gp program over number fields in
Sage), not least because the current interface is not very good (hard to
use non-standard parameter settings, for example) and uses the ancient
ratpoints, all because I have not had the time to improve those things.
Experience tells me that if you put in code which was designed for curves
with small conductor then you will very soon find that people try to run
the same code on huge examples. This is precisely what happened to me --
the first version of what later became mwrank was written solely for the
purpose of computing the ranks of the curves in my book, i.e. N<1000. So
the new code must be tested on large examples too.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6583#comment:16>
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.
