Opened 6 years ago

Closed 6 years ago

#18856 closed enhancement (fixed)

Add a FLINT algorithm for Bernoulli numbers

Reported by: jdemeyer Owned by:
Priority: major Milestone: sage-6.8
Component: number theory Keywords:
Cc: Merged in:
Authors: Jeroen Demeyer Reviewers: Travis Scrimshaw
Report Upstream: N/A Work issues:
Branch: f9e3691 (Commits, GitHub, GitLab) Commit: f9e36912ed0b1b6d9ed867ea86bb4bdc11eff08d
Dependencies: Stopgaps:

Status badges

Description (last modified by jdemeyer)

In all cases, FLINT seems to be faster than PARI. Therefore, I made FLINT the default for small values of n. For large values of n, bernmm is still faster. After some benchmarks on my laptop, I set the FLINT/bernmm cross-over point at n = 300000.

Change History (5)

comment:1 Changed 6 years ago by jdemeyer

  • Branch set to u/jdemeyer/add_a_flint_algorithm_for_bernoulli_numbers

comment:2 Changed 6 years ago by jdemeyer

  • Commit set to f9e36912ed0b1b6d9ed867ea86bb4bdc11eff08d
  • Status changed from new to needs_review

New commits:

f9e3691Add a FLINT implementation of Bernoulli numbers

comment:3 Changed 6 years ago by jdemeyer

  • Description modified (diff)

comment:4 Changed 6 years ago by tscrim

  • Reviewers set to Travis Scrimshaw
  • Status changed from needs_review to positive_review

LGTM.

comment:5 Changed 6 years ago by vbraun

  • Branch changed from u/jdemeyer/add_a_flint_algorithm_for_bernoulli_numbers to f9e36912ed0b1b6d9ed867ea86bb4bdc11eff08d
  • Resolution set to fixed
  • Status changed from positive_review to closed
Note: See TracTickets for help on using tickets.