ratpoints is a program for finding points of bounded height on curves of the form
y^2 = a_n x^n + ... + a_1 x + a_0. A version of ratpoints was the starting point of John Cremona's mwrank, but since then there have been substantial improvements. I have been working on a Sage-native implementation of 2-descent on elliptic curves, using ratpoints, GMP, and FLINT. It is significantly faster than Magma, which is significantly faster than mwrank (at least on the curves I've been looking at-- I haven't done extensive benchmarking yet). The webpage for the software is here: http://www.mathe2.uni-bayreuth.de/stoll/programs/index.html The trac ticket is here: http://trac.sagemath.org/sage_trac/ticket/5854 There are some memory leaks in ratpoints, but we will work on fixing these next week at Dagstuhl. Statistics: spkg size: 255K time to build: 5.6 secs What does everyone think? --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
