A Highly Accurate Upper Bound for the Cumulative Standard Normal Distribution Function and Related Functions
DOI:
https://doi.org/10.19139/soic-2310-5070-3391Keywords:
Bonds for CDF of standard normal, Polya bound, Error function, Q-function, Maximum absolute errorAbstract
Although there is extensive literature concerning upper bounds for the cumulative standard normal distribution function Φ(x), many existing bounds are not uniformly accurate over the entire domain x ≥ 0. This paper proposes a new explicit upper bound for Φ(x) that is uniformly accurate over x ≥ 0 and improves the classical Polya upper bound and several related bounds available in the literature. The proposed bound is constructed by modifying the classical Polya structure through the introduction of a polynomial correction term inside the exponential function, leading to a flexible parametric form. The coefficients of this correction polynomial are determined using a constrained minimax-type optimization framework combined with local accuracy conditions obtained through Taylor-series matching near the origin, ensuring both global tightness and local stability. It is shown that the maximum absolute error between the proposed bound and the exact function Φ(x) does not exceed 5.785 × 10^(−5) for all x ≥ 0. Numerical comparisons and graphical illustrations demonstrate that the proposed bound is consistently tighter than several well-known alternative bounds, particularly in the small and moderate range of x. The structure of the bound also preserves analytical tractability, making it suitable for theoretical analysis and computational applications. Finally, due to the functional relationships between Φ(x), the Q-function and the error function, the proposed construction can be directly extended to derive corresponding bounds for these related special functions.Downloads
Published
2026-07-20
How to Cite
Eidous, O. M. (2026). A Highly Accurate Upper Bound for the Cumulative Standard Normal Distribution Function and Related Functions. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-3391
Issue
Section
Research Articles
License
Copyright (c) 2026 Omar M. Eidous

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).