...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
#include <boost/math/special_functions/beta.hpp>
namespace boost{ namespace math{ template <class T1, class T2> calculatedresulttype beta(T1 a, T2 b); template <class T1, class T2, class Policy> calculatedresulttype beta(T1 a, T2 b, const Policy&); }} // namespaces
The beta function is defined by:
The final Policy argument is optional and can be used to control the behaviour of the function: how it handles errors, what level of precision to use etc. Refer to the policy documentation for more details.
The return type of these functions is computed using the result type calculation rules when T1 and T2 are different types.
The following table shows peak errors for various domains of input arguments, along with comparisons to the GSL1.9 and Cephes libraries. Note that only results for the widest floating point type on the system are given as narrower types have effectively zero error.
Table 8.17. Error rates for beta
GNU C++ version 7.1.0 
GNU C++ version 7.1.0 
Sun compiler version 0x5150 
Microsoft Visual C++ version 14.1 


Beta Function: Small Values 
Max = 0ε (Mean = 0ε) 
Max = 2.86ε (Mean = 1.22ε) 
Max = 2.86ε (Mean = 1.22ε) 
Max = 2.23ε (Mean = 1.14ε) 
Beta Function: Medium Values 
Max = 0.978ε (Mean = 0.0595ε) 
Max = 61.4ε (Mean = 19.4ε) 
Max = 107ε (Mean = 24.5ε) 
Max = 96.5ε (Mean = 22.4ε) 
Beta Function: Divergent Values 
Max = 0ε (Mean = 0ε) 
Max = 8.99ε (Mean = 2.44ε) 
Max = 18.8ε (Mean = 2.71ε) 
Max = 11.4ε (Mean = 2.19ε) 
Note that the worst errors occur when a or b are large, and that when this is the case the result is very close to zero, so absolute errors will be very small.
A mixture of spot tests of exact values, and randomly generated test data are used: the test data was computed using NTL::RR at 1000bit precision.
Traditional methods of evaluating the beta function either involve evaluating the gamma functions directly, or taking logarithms and then exponentiating the result. However, the former is prone to overflows for even very modest arguments, while the latter is prone to cancellation errors. As an alternative, if we regard the gamma function as a whitebox containing the Lanczos approximation, then we can combine the power terms:
which is almost the ideal solution, however almost all of the error occurs in evaluating the power terms when a or b are large. If we assume that a > b then the larger of the two power terms can be reduced by a factor of b, which immediately cuts the maximum error in half:
This may not be the final solution, but it is very competitive compared to other implementation methods.
The generic implementation  where no Lanczos approximation approximation is available  is implemented in a very similar way to the generic version of the gamma function by means of Sterling's approximation. Again in order to avoid numerical overflow the power terms that prefix the series are collected together
There are a few special cases worth mentioning:
When a or b are less than one, we can use the recurrence relations:
to move to a more favorable region where they are both greater than 1.
In addition: