betaFeedback

WorksMathematics

Efficient Recursive Evaluation of Gaussian, Gamma, and Inverse Gaussian Tail Probabilities

Abstract

Accurate computation of tail probabilities motivates efficient high-order implementations of the Gn(1)G_n^{(1)} extrapolation transformation. We derive finite recurrence relations in the transformation order for Gaussian, gamma, and inverse Gaussian tail approximations. The Gaussian and inverse Gaussian numerator and denominator sequences satisfy four-term recurrences, whereas the gamma sequences satisfy a three-term recurrence. The derivation exploits the structure of the underlying differential operator and shows that the reduced numerator and denominator obey recurrences with identical coefficients. This construction avoids the repeated evaluation of higher-order derivatives and nested sums required by the explicit formulations. As a result, generating the approximation sequence through order nn requires O(n)O(n) arithmetic operations, compared with O(n3)O(n^3) for the Gaussian and gamma distributions and O(n4)O(n^4) for the inverse Gaussian distribution. The recurrence algorithms also require only a fixed number of previously computed quantities at each order. Numerical results for the three distributions are in excellent agreement with values reported in the literature

Paper details

vlnc:W_nuuvw8zq
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…