Chebyshev subinterval polynomial approximations for continuous distribution function

Chebyshev subinterval polynomial approximations for continuous distribution function

0.00 Avg rating0 Votes
Article ID: iaor1989366
Country: United States
Volume: 36
Issue: 4
Start Page Number: 389
End Page Number: 397
Publication Date: Aug 1989
Journal: Naval Research Logistics
Authors: ,
Abstract:

An algorithm for constructing a three-subinterval approximation for any continuous distribution function is presented in which the Chebyshev criterion is used, or equivalently, the maximum absolute error (MAE) is minimized. The resulting approximation of this algorithm for the standard normal distribution function provides a guideline for constructing the simple approximation formulas proposed by Shah. Furthermore, the above algorithm is extended to more accurate computer applications, by constructing a four-polynomial approximation for a distribution function. The resulting approximation for the standard normal distribution function is at least as accurate as, faster, and more efficient than the six-polynomial approximation proposed by Milton and Hotchkiss and modified by Milton.

Reviews

Required fields are marked *. Your email address will not be published.