-
Recent Posts
Archives
- April 2013 (1)
- March 2013 (4)
- February 2013 (3)
- January 2013 (1)
- November 2012 (1)
- October 2012 (1)
- September 2012 (5)
- July 2012 (1)
- May 2012 (2)
- April 2012 (3)
- March 2012 (2)
- January 2012 (1)
- June 2011 (1)
- March 2011 (2)
- September 2010 (3)
- July 2010 (4)
- June 2010 (3)
- March 2010 (3)
- February 2010 (4)
- January 2010 (4)
- December 2009 (1)
- September 2009 (1)
- August 2009 (4)
- July 2009 (3)
- June 2009 (5)
- May 2009 (2)
- March 2009 (1)
- February 2009 (5)
- January 2009 (2)
- November 2008 (1)
- October 2008 (2)
- September 2008 (1)
- August 2008 (1)
- July 2008 (4)
Blogroll
Meta
Category Archives: sage
An even speedier gamma function
I’ve just pushed some new code to the Arb git repository for computing numerical rising factorials ($x (x+1) (x+2)\cdots (x+n-1)$) faster. It works by expanding subproducts as symbolic polynomials, and evaluating them using the rectangular splitting algorithm mentioned in the … Continue reading
Partitions into the quintillions
One of my biggest undertakings last year was to implement the partition function $p(n)$ in FLINT. With this code, I was able to set a record by computing the number of partitions of $10^{19}$, or 10,000,000,000,000,000,000 (ten quintillion). The number … Continue reading
Posted in flint, partitions, sage
Comments Off
Some FLINT 2.2 highlights
Version 2.2 of FLINT (Fast Library for Number Theory) was released last weekend. Some updated benchmarks are available. In this blog post, I’m going to talk a bit about features I contributed in this version. With apologies to Sebastian Pancratz … Continue reading
100 mpmath one-liners for pi
Since it’s pi day today, I thought I’d share a list of mpmath one-liners for computing the value of pi to high precision using various representations in terms of special functions, infinite series, integrals, etc. Most of them can already … Continue reading