s18ae returns the value of the modified Bessel function ${I}_{0}\left(x\right)$.

# Syntax

C#
```public static double s18ae(
double x,
out int ifail
)```
Visual Basic
```Public Shared Function s18ae ( _
x As Double, _
<OutAttribute> ByRef ifail As Integer _
) As Double```
Visual C++
```public:
static double s18ae(
double x,
[OutAttribute] int% ifail
)```
F#
```static member s18ae :
x : float *
ifail : int byref -> float
```

#### Parameters

x
Type: System..::..Double
On entry: the argument $x$ of the function.
ifail
Type: System..::..Int32%
On exit: ${\mathbf{ifail}}={0}$ unless the method detects an error or a warning has been flagged (see [Error Indicators and Warnings]).

#### Return Value

s18ae returns the value of the modified Bessel function ${I}_{0}\left(x\right)$.

# Description

s18ae evaluates an approximation to the modified Bessel function of the first kind ${I}_{0}\left(x\right)$.
Note:  ${I}_{0}\left(-x\right)={I}_{0}\left(x\right)$, so the approximation need only consider $x\ge 0$.
The method is based on three Chebyshev expansions:
For $0,
 $I0x=ex∑′r=0arTrt, where ​t=2x4-1.$
For $4,
 $I0x=ex∑′r=0brTrt, where ​t=x-84.$
For $x>12$,
 $I0x=exx∑′r=0crTrt, where ​t=212x-1.$
For small $x$, ${I}_{0}\left(x\right)\simeq 1$. This approximation is used when $x$ is sufficiently small for the result to be correct to machine precision.
For large $x$, the method must fail because of the danger of overflow in calculating ${e}^{x}$.

# References

Abramowitz M and Stegun I A (1972) Handbook of Mathematical Functions (3rd Edition) Dover Publications

# Error Indicators and Warnings

Errors or warnings detected by the method:
${\mathbf{ifail}}=1$
$\left|{\mathbf{x}}\right|$ is too large. On failure the method returns the approximate value of ${I}_{0}\left(x\right)$ at the nearest valid argument. (see the Users' Note for your implementation for details)
${\mathbf{ifail}}=-9000$
An error occured, see message report.

# Accuracy

Let $\delta$ and $\epsilon$ be the relative errors in the argument and result respectively.
If $\delta$ is somewhat larger than the machine precision (i.e., if $\delta$ is due to data errors etc.), then $\epsilon$ and $\delta$ are approximately related by:
 $ε≃xI1xI0xδ.$
Figure 1 shows the behaviour of the error amplification factor
 $xI1xI0x.$
Figure 1
However if $\delta$ is of the same order as machine precision, then rounding errors could make $\epsilon$ slightly larger than the above relation predicts.
For small $x$ the amplification factor is approximately $\frac{{x}^{2}}{2}$, which implies strong attenuation of the error, but in general $\epsilon$ can never be less than the machine precision.
For large $x$, $\epsilon \simeq x\delta$ and we have strong amplification of errors. However the method must fail for quite moderate values of $x$, because ${I}_{0}\left(x\right)$ would overflow; hence in practice the loss of accuracy for large $x$ is not excessive. Note that for large $x$ the errors will be dominated by those of the standard function exp.

None.

None.

# Example

This example reads values of the argument $x$ from a file, evaluates the function at each value of $x$ and prints the results.

Example program (C#): s18aee.cs

Example program data: s18aee.d

Example program results: s18aee.r