...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/distributions/non_central_t.hpp>
namespace boost{ namespace math{ template <class RealType = double, class Policy = policies::policy<> > class non_central_t_distribution; typedef non_central_t_distribution<> non_central_t; template <class RealType, class Policy> class non_central_t_distribution { public: typedef RealType value_type; typedef Policy policy_type; // Constructor: non_central_t_distribution(RealType v, RealType delta); // Accessor to degrees_of_freedom parameter v: RealType degrees_of_freedom()const; // Accessor to noncentrality parameter delta: RealType non_centrality()const; }; }} // namespaces
The noncentral T distribution is a generalization of the Students t Distribution. Let X have a normal distribution with mean δ and variance 1, and let ν S^{2} have a chisquared distribution with degrees of freedom ν. Assume that X and S^{2} are independent. The distribution of t_{ν}(δ)=X/S is called a noncentral t distribution with degrees of freedom ν and noncentrality parameter δ.
This gives the following PDF:
where _{1}F_{1}(a;b;x) is a confluent hypergeometric function.
The following graph illustrates how the distribution changes for different values of ν and δ:
non_central_t_distribution(RealType v, RealType delta);
Constructs a noncentral t distribution with degrees of freedom parameter v and noncentrality parameter delta.
Requires v > 0 (including positive infinity) and finite delta, otherwise calls domain_error.
RealType degrees_of_freedom()const;
Returns the parameter v from which this object was constructed.
RealType non_centrality()const;
Returns the noncentrality parameter delta from which this object was constructed.
All the usual nonmember accessor functions that are generic to all distributions are supported: Cumulative Distribution Function, Probability Density Function, Quantile, Hazard Function, Cumulative Hazard Function, mean, median, mode, variance, standard deviation, skewness, kurtosis, kurtosis_excess, range and support.
The domain of the random variable is [∞, +∞].
The following table shows the peak errors (in units of epsilon) found on various platforms with various floatingpoint types. Unless otherwise specified, any floatingpoint type that is narrower than the one shown will have effectively zero error.
Table 5.8. Error rates for non central t CDF
GNU C++ version 7.1.0 
GNU C++ version 7.1.0 
Sun compiler version 0x5150 
Microsoft Visual C++ version 14.1 


Non Central T 
Max = 0.796ε (Mean = 0.0691ε) 
Max = 139ε (Mean = 31ε) 
Max = 145ε (Mean = 30.9ε) 
Max = 135ε (Mean = 32.1ε) 
Non Central T (small noncentrality) 
Max = 0ε (Mean = 0ε) 
Max = 3.86ε (Mean = 1.4ε) 
Max = 9.15ε (Mean = 2.13ε) 
Max = 6.17ε (Mean = 1.45ε) 
Non Central T (large parameters) 
Max = 257ε (Mean = 72.1ε) 
Max = 5.26e+05ε (Mean = 1.48e+05ε) 
Max = 5.24e+05ε (Mean = 1.47e+05ε) 
Max = 286ε (Mean = 62.8ε) 
Table 5.9. Error rates for non central t CDF complement
GNU C++ version 7.1.0 
GNU C++ version 7.1.0 
Sun compiler version 0x5150 
Microsoft Visual C++ version 14.1 


Non Central T 
Max = 0.707ε (Mean = 0.0497ε) 
Max = 201ε (Mean = 31.7ε) 
Max = 340ε (Mean = 43.2ε) 
Max = 154ε (Mean = 32.1ε) 
Non Central T (small noncentrality) 
Max = 0ε (Mean = 0ε) 
Max = 10.5ε (Mean = 2.13ε) 
Max = 10.5ε (Mean = 2.39ε) 
Max = 4.6ε (Mean = 1.63ε) 
Non Central T (large parameters) 
Max = 478ε (Mean = 96.3ε) 
Max = 9.79e+05ε (Mean = 1.97e+05ε) 
Max = 9.79e+05ε (Mean = 1.97e+05ε) 
Max = 227ε (Mean = 50.4ε) 
Caution  

The complexity of the current algorithm is dependent upon δ^{2}: consequently the time taken to evaluate the CDF increases rapidly for δ > 500, likewise the accuracy decreases rapidly for very large δ. 
Accuracy for the quantile and PDF functions should be broadly similar.
The mode is determined numerically and cannot in principal
be more accurate than the square root of floatingpoint type FPT epsilon,
accessed using boost::math::tools::epsilon<FPT>()
.
For 64bit double
, epsilon
is about 1e16, so the fractional accuracy is limited to 1e8.
There are two sets of tests of this distribution:
Basic sanity checks compare this implementation to the test values given in "Computing discrete mixtures of continuous distributions: noncentral chisquare, noncentral t and the distribution of the square of the sample multiple correlation coefficient." Denise Benton, K. Krishnamoorthy, Computational Statistics & Data Analysis 43 (2003) 249267.
Accuracy checks use test data computed with this implementation and arbitary precision interval arithmetic: this test data is believed to be accurate to at least 50 decimal places.
The cases of large (or infinite) ν and/or large δ has received special treatment to avoid catastrophic loss of accuracy. New tests have been added to confirm the improvement achieved.
From Boost 1.52, degrees of freedom ν can be +∞ when the normal distribution located at δ (equivalent to the central Student's t distribution) is used in place for accuracy and speed.
The CDF is computed using a modification of the method described in "Computing discrete mixtures of continuous distributions: noncentral chisquare, noncentral t and the distribution of the square of the sample multiple correlation coefficient." Denise Benton, K. Krishnamoorthy, Computational Statistics & Data Analysis 43 (2003) 249267.
This uses the following formula for the CDF:
Where I_{x}(a,b) is the incomplete beta function, and Φ(x) is the normal CDF at x.
Iteration starts at the largest of the Poisson weighting terms (at i = δ^{2} / 2) and then proceeds in both directions as per Benton and Krishnamoorthy's paper.
Alternatively, by considering what happens when t = ∞, we have x = 1, and therefore I_{x}(a,b) = 1 and:
From this we can easily show that:
and therefore we have a means to compute either the probability or its complement directly without the risk of cancellation error. The crossover criterion for choosing whether to calculate the CDF or its complement is the same as for the Noncentral Beta Distribution.
The PDF can be computed by a very similar method using:
Where I_{x}^{'}(a,b) is the derivative of the incomplete beta function.
For both the PDF and CDF we switch to approximating the distribution by a Student's t distribution centred on δ when ν is very large. The crossover location appears to be when δ/(4ν) < ε, this location was estimated by inspection of equation 2.6 in "A Comparison of Approximations To Percentiles of the Noncentral tDistribution". H. Sahai and M. M. Ojeda, Revista Investigacion Operacional Vol 21, No 2, 2000, page 123.
Equation 2.6 is a FisherCornish expansion by Eeden and Johnson. The second term includes the ratio δ/(4ν), so when this term become negligible, this and following terms can be ignored, leaving just Student's t distribution centred on δ.
This was also confirmed by experimental testing.
See also
The quantile is calculated via the usual rootfinding without derivatives method with the initial guess taken as the quantile of a normal approximation to the noncentral T.
There is no closed form for the mode, so this is computed via functional maximisation of the PDF.
The remaining functions (mean, variance etc) are implemented using the formulas given in Weisstein, Eric W. "Noncentral Student's tDistribution." From MathWorldA Wolfram Web Resource. http://mathworld.wolfram.com/NoncentralStudentstDistribution.html and in the Mathematica documentation.
Some analytic properties of noncentral distributions (particularly unimodality, and monotonicity of their modes) are surveyed and summarized by:
Andrea van Aubel & Wolfgang Gawronski, Applied Mathematics and Computation, 141 (2003) 312.