Improvements of Polya Upper Bound for Cumulative Standard Normal Distribution and Related Functions

05/06/2022
by   Omar Eidous, et al.
0

Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound for standard normal distribution function, in the sense that its maximum absolute difference from phi(x) is less than for all values of x. The established bound improves the well-known Polya upper bound and it can be used as an approximation for Phi(x) itself with a very satisfactory accuracy. Numerical comparisons between the proposed upper bound and some other existing upper bounds have been achieved, which show that the proposed bound is tighter than alternative bounds found in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/11/2022

A New Bound for the Orthogonality Defect of HKZ Reduced Lattices

In this work, we determine a sharp upper bound on the orthogonality defe...
research
07/10/2020

An Upper Bound on the Error Induced by Saddlepoint Approximations – Applications to Information Theory

This paper introduces an upper bound on the absolute difference between:...
research
06/25/2022

Approximations for Standard Normal Distribution Function and Its Invertible

In this paper, we introduce a new approximation of the cumulative distri...
research
04/25/2018

On The Complexity of Sparse Label Propagation

This paper investigates the computational complexity of sparse label pro...
research
03/13/2023

Submatrices with the best-bounded inverses: revisiting the hypothesis

The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Z...
research
01/29/2020

An Upper Bound of the Bias of Nadaraya-Watson Kernel Regression under Lipschitz Assumptions

The Nadaraya-Watson kernel estimator is among the most popular nonparame...
research
06/29/2016

Tighter bounds lead to improved classifiers

The standard approach to supervised classification involves the minimiza...

Please sign up or login with your details

Forgot password? Click here to reset