Changes between Version 3 and Version 4 of SoC2013

Timestamp:

Feb 20, 2013, 10:41:18 AM (10 years ago)

Author:

Paul A. Bristow

Comment:

Added Bernoulli numbers project

SoC2013

@@ -49 +49 @@
 
 Mentor: David Bellot (david.bellot[at]gmail.com)
+
+
+=== Boost.Math Bernoulli numbers === 
+Boost.Math [http://www.boost.org/doc/libs/1_53_0/libs/math/doc/sf_and_dist/html/]
+is a large well-established Boost library, but new mathmetical functions can always be added.  
+
+
+We wonder if students would be interested in adding Bernoulli numbers needed in several useful series.
+
+[http://en.wikipedia.org/wiki/Bernoulli_number]
+
+[http://mathworld.wolfram.com/BernoulliNumber.html]
+
+* Add support for Bernoulli numbers along with thread-safe caching.
+* Add support for polygamma of positive integer order (requires Bernoulli numbers).
+* Improve tgamma/lgamma for multiprecision types based on Stirling's approx.
+* Optional: Add support for the Hurwitz zeta function.
+
+This would clearly require some serious math skills, but also good knowledge of C++,
+especially using templates which Boost.Math makes much use of to provide not only
+built-in double and long double but recently multiprecision, large fixed and arbitrary precision.
+
+If studying [http://svn.boost.org/svn/boost/trunk/boost/math/special_functions/gamma.hpp]
+leaves you frightened, then this project is not for you.
+
+If you would like to demonstrate your skills, you might like to try coding the naive
+Akiyama–Tanigawa algorithm for second Bernoulli numbers Bn
+[http://en.wikipedia.org/wiki/Bernoulli_number#Algorithmic_description]
+using Boost.Math.  Extra marks for providing a Boost.Test comparing with a handful of published values.
+You can use any platform, Linux, Mac or Microsoft with your IDE of choice, perhaps Visual Studio or NetBeans.
+
+The project will by mentored by Paul Bristow for administration and Boost infrastructure,
+and John Maddock and Christopher Kormanyos for mathematical and algorithmic expertise. 
+