|Bill Allombert on Wed, 25 Jun 2014 14:46:56 +0200|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Re: New ellL1 implementation by Pascal Molin|
On Sun, Jun 22, 2014 at 12:21:25PM +0200, Bill Allombert wrote: > Dear PARI developers, > > I have merged Pascal Molin code for computing ellL1 and ellanalyticrank. > The new code is much faster than the old one for derivatives. > For the value of L itself, it is slightly slower, but only because the > older code used unproven (and sometimes wrong) bounds for the summation. > > This makes ellheegner faster when the height of the point is large. I have commited a second patch that adds an alternative summation strategy suggested by Pascal. ellL1 will choose the strategy that requires the less amount of memory. Cheers, Bill.