Stirling numbers of the first kind are common in number theory and combinatorics;through Ewen's sampling formula, these numbers enter into the calculation of several population genetics statistics, such as Fu'...
详细信息
Stirling numbers of the first kind are common in number theory and combinatorics;through Ewen's sampling formula, these numbers enter into the calculation of several population genetics statistics, such as Fu's F-s. In previous papers we have considered an asymptotic estimator for a finite sum of Stirling numbers, which enables rapid and accurate calculation of Fu's *** sums can also be viewed as cumulative distribution functions, leading directly to the possibility of an inversion function, where, given a value for Fu's F-s, the goal is to solve for one of the input parameters. We solve this inversion using Newton iteration for small parameters. For large parameters, we have to extend our earlier obtained asymptotic results to solve the inversion problem asymptotically. Numerical experiments are given to show the efficiency of both solving the inversion problem and the expanded asymptotic estimator for sums of Stirling numbers.
暂无评论