> > I'm curious if anyone here knows of faster algorithms for harmonic > > numbers / Stirling numbers? This list seems like the right place to > > ask :-) > > I don't know, but hopefully someone will see the bump and respond. > Paul Zimmermann might be the right guy, but he doesn't read sage-devel > very intensely AFAIK, so I am CCing him.
I'm not sure I can post to sage-devel. Anyway, if computing Stirling numbers reduces to compute factorial-like expressions, the best algorithm I know is due to Schönhage; Cf for example for double factorials: http://gmplib.org/list-archives/gmp-discuss/2009-January/003510.html Paul Zimmermann --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
