s18ad returns the value of the modified Bessel function .
Syntax
C# |
---|
public static double s18ad( double x, out int ifail ) |
Visual Basic |
---|
Public Shared Function s18ad ( _ x As Double, _ <OutAttribute> ByRef ifail As Integer _ ) As Double |
Visual C++ |
---|
public: static double s18ad( double x, [OutAttribute] int% ifail ) |
F# |
---|
static member s18ad : x : float * ifail : int byref -> float |
Parameters
- x
- Type: System..::..DoubleOn entry: the argument of the function.Constraint: .
- ifail
- Type: System..::..Int32%On exit: unless the method detects an error or a warning has been flagged (see [Error Indicators and Warnings]).
Return Value
s18ad returns the value of the modified Bessel function .
Description
s18ad evaluates an approximation to the modified Bessel function of the second kind .
Note: is undefined for and the method will fail for such arguments.
The method is based on five Chebyshev expansions:
For ,
For ,
For ,
For ,
For near zero, . This approximation is used when is sufficiently small for the result to be correct to machine precision. For very small on some machines, it is impossible to calculate without overflow and the method must fail.
For large , where there is a danger of underflow due to the smallness of , the result is set exactly to zero.
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:
- , is undefined. On failure the method returns zero.
- x is too small, there is a danger of overflow. On failure the method returns approximately the largest representable value. (see the Users' Note for your implementation for details)
Accuracy
Let and be the relative errors in the argument and result respectively.
If is somewhat larger than the machine precision (i.e., if is due to data errors etc.), then and are approximately related by:
Figure 1 shows the behaviour of the error amplification factor
However if is of the same order as the machine precision, then rounding errors could make slightly larger than the above relation predicts.
For small , and there is no amplification of errors.
For large , and we have strong amplification of the relative error. Eventually , which is asymptotically given by , becomes so small that it cannot be calculated without underflow and hence the method will return zero. Note that for large the errors will be dominated by those of the standard function exp.
Parallelism and Performance
None.
Further Comments
None.
Example
This example reads values of the argument from a file, evaluates the function at each value of and prints the results.
Example program (C#): s18ade.cs