Answers are grounded in this paper and cite their sources.
Recursion relations suitable for rapid computation are derived for the cumulative distribution of F′ = (X/m)/(Y/n) where X is χ2(λ, m) and Y is independently χ2(n). When n is even no complicated function evaluations are needed. For n odd, a special doubly noncentral t distribution is needed to start the computation. Series representations for this t distribution are given with rigorous bounds on truncation errors. Proper recursion techniques for numerical evaluation of the special functions are given.
No takes yet. Share an insight, caveat, or question.
D. E. Amos (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: