Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Chebyshev Approximation of $(1 + 2x)\exp(x^2)\operatorname{erfc} x$ in $0 \leqslant x < \infty$

M. M. Shepherd and J. G. Laframboise
Mathematics of Computation
Vol. 36, No. 153 (Jan., 1981), pp. 249-253
DOI: 10.2307/2007742
Stable URL: http://www.jstor.org/stable/2007742
Page Count: 5
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Chebyshev Approximation of $(1 + 2x)\exp(x^2)\operatorname{erfc} x$ in $0 \leqslant x < \infty$
Preview not available

Abstract

We have obtained a single Chebyshev expansion of the function $f(x) = (1 + 2x)\exp(x^2)\operatorname{erfc} x$ in $0 \leqslant x < \infty$, accurate to 22 decimal digits. The presence of the factors $(1 + 2x)\exp(x^2)$ causes $f(x)$ to be of order unity throughout this range, ensuring that the use of $f(x)$ for approximating $\operatorname{erfc} x$ will give uniform relative accuracy for all values of $x$.

Page Thumbnails

  • Thumbnail: Page 
249
    249
  • Thumbnail: Page 
250
    250
  • Thumbnail: Page 
251
    251
  • Thumbnail: Page 
252
    252
  • Thumbnail: Page 
253
    253