✦ LIBER ✦

Chebyshev subinterval polynomial approximations for continuous distribution functions

✍ Scribed by Hsien-Tang Tsai; Herbert Moskowitz

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 412 KB
Volume: 36
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(198908)36:4<389::aid-nav3220360405>3.0.co;2-s

No coin nor oath required. For personal study only.

✦ Synopsis

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 [ 131. 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 [ 111 and modified by Milton [ 101.

📜 SIMILAR VOLUMES

Adaptive procedure for approximating fun

Adaptive procedure for approximating functions by continuous piecewise polynomials

✍ Chen, Qi ;Babuška, Ivo 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 727 KB

The problem of approximating functions is considered in a general domain in one and two dimensions using piecewise polynomial interpolation. An error estimator is proposed which shows how to adaptively determine the interpolation degree. Numerical examples are given.

Kernel Polynomial Approximations for Den

Kernel Polynomial Approximations for Densities of States and Spectral Functions

✍ R.N. Silver; H. Roeder; A.F. Voter; J.D. Kress 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 KB

the DOS of the Holstein t-J model [3], to the dielectric constants of Si quantum dots [4], to linear scaling algo-Chebyshev polynomial approximations are an efficient and numerically stable way to calculate properties of the very large Hamil-rithms for tight-binding molecular dynamics [5], to projec

Generalized Chebyshev Inequalities for s

Generalized Chebyshev Inequalities for some Classes of Distribution Functions

✍ Eduard Danielian; Karen Tatalian 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB

Simple piecewise continuous approximatio

Simple piecewise continuous approximations for the Bloch–Grueneisen functions

✍ Gary L. Fuller 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Approximation of multivariate functions

Approximation of multivariate functions and evaluation of particular solutions using Chebyshev polynomial and trigonometric basis functions

✍ S. Y. Reutskiy; C. S. Chen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

Chebyshev polynomial approximation for h

Chebyshev polynomial approximation for high-order partial differential equations with complicated conditions

✍ Aysegül Akyüz-Dascioglu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB