naginterfaces.library.specfun.erfcx_​real_​vector

naginterfaces.library.specfun.erfcx_real_vector(x)

erfcx_real_vector returns an array of values of the scaled complementary error function $erfcx\left(x\right)$.

For full information please refer to the NAG Library document for s15au

https://support.nag.com/numeric/nl/nagdoc_30/flhtml/s/s15auf.html

Parameters

xfloat, array-like, shape $\left(n\right)$

The argument $x_{\text{i}}$ of the function, for $\text{i}=1,2,\dots ,n$.

Returns

ffloat, ndarray, shape $\left(n\right)$

$erfcx\left(x_i\right)$, the function values.

ivalidint, ndarray, shape $\left(n\right)$

$ivalid[\text{i}-1]$ contains the error code for $x_{\text{i}}$, for $\text{i}=1,2,\dots ,n$.

$ivalid[i-1]=0$

No error.

$ivalid[i-1]=1$

$x_i$ is too large and positive. The threshold value is the same as for $errno$ = 1 in erfcx_real().

$ivalid[i-1]=2$

$x_i$ was in the interval $[1/\left(2\sqrt{ϵ}\right),x_{hi})$. The threshold values are the same as for $errno$ = 2 in erfcx_real().

$ivalid[i-1]=3$

$x_i$ is too small and positive. The threshold value is the same as for $errno$ = 3 in erfcx_real().

Raises

NagValueError

(errno $2$)

On entry, $n=⟨value⟩$.

Constraint: $n\ge 0$.

Warns

NagAlgorithmicWarning

(errno $1$)

On entry, at least one value of $x$ produced a result with reduced accuracy.

Check $ivalid$ for more information.

Notes

erfcx_real_vector calculates approximate values for the scaled complementary error function

$$erfcx\left(x\right)=e^{x^2}erfc\left(x\right)=\frac{2}{\sqrt{\pi }}{e}^{x^2}{\int }_x^{\infty }{e}^{-t^2}dt=e^{x^2}(1-erf\left(x\right))\text{,}$$

for an array of arguments $x_{\text{i}}$, for $\text{i}=1,2,\dots ,n$.

Let $\hat{x}$ be the root of the equation $erfc\left(x\right)-erf\left(x\right)=0$ (then $\hat{x}\approx 0.46875$). For $\left|x\right|\le \hat{x}$ the value of $erfcx\left(x\right)$ is based on the following rational Chebyshev expansion for $erf\left(x\right)$:

$$erf\left(x\right)\approx x{R}_{\ell ,m}\left(x^2\right)\text{,}$$

where $R_{\ell ,m}$ denotes a rational function of degree $\ell$ in the numerator and $m$ in the denominator.

For $\left|x\right|>\hat{x}$ the value of $erfcx\left(x\right)$ is based on a rational Chebyshev expansion for $erfc\left(x\right)$: for $\hat{x}<\left|x\right|\le 4$ the value is based on the expansion

$$erfc\left(x\right)\approx e^{x^2}{R}_{\ell ,m}\left(x\right)\text{;}$$

and for $\left|x\right|>4$ it is based on the expansion

$$erfc\left(x\right)\approx \frac{e^{x^2}}{x}(\frac{1}{\sqrt{\pi }}+\frac{1}{x^2}{R}_{\ell ,m}\left(1/x^2\right))\text{.}$$

For each expansion, the specific values of $\ell$ and $m$ are selected to be minimal such that the maximum relative error in the expansion is of the order ${10}^{-d}$, where $d$ is the maximum number of decimal digits that can be accurately represented for the particular implementation (see machine.decimal_digits).

Asymptotically, $erfcx\left(x\right)\sim 1/\left(\sqrt{\pi }\left|x\right|\right)$. There is a danger of setting underflow in $erfcx\left(x\right)$ whenever $x\ge x_{hi}=min(x_{huge},1/\left(\sqrt{\pi }{x}_{tiny}\right))$, where $x_{huge}$ is the largest positive model number (see machine.real_largest) and $x_{tiny}$ is the smallest positive model number (see machine.real_smallest). In this case erfcx_real_vector exits with $errno$ = 1 and returns $ivalid[i-1]=1$ with $erfcx\left(x_i\right)=0$. For $x$ in the range $1/\left(2\sqrt{ϵ}\right)\le x<x_{hi}$, where $ϵ$ is the machine precision, the asymptotic value $1/\left(\sqrt{\pi }\left|x\right|\right)$ is returned for $erfcx\left(x_i\right)$, $ivalid[i-1]=2$, and erfcx_real_vector exits with $errno$ = 1.

There is a danger of setting overflow in $e^{x^2}$ whenever $x<x_{neg}=-\sqrt{\log \left(x_{huge}/2\right)}$. In this case erfcx_real_vector exits with $errno$ = 1 and returns $ivalid[i-1]=3$ with $erfcx\left(x_i\right)=x_{huge}$.

References

NIST Digital Library of Mathematical Functions

Cody, W J, 1969, Rational Chebyshev approximations for the error function, Math.Comp. (23), 631–637