S17AUF (PDF version)
S Chapter Contents
S Chapter Introduction
NAG Library Manual

NAG Library Routine Document

S17AUF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

 Contents

    1  Purpose
    7  Accuracy

1  Purpose

S17AUF returns an array of values for the Airy function, Aix.

2  Specification

SUBROUTINE S17AUF ( N, X, F, IVALID, IFAIL)
INTEGER  N, IVALID(N), IFAIL
REAL (KIND=nag_wp)  X(N), F(N)

3  Description

S17AUF evaluates an approximation to the Airy function, Aixi for an array of arguments xi, for i=1,2,,n. It is based on a number of Chebyshev expansions:
For x<-5,
Aix=atsinz-btcosz-x1/4  
where z= π4+ 23-x3, and at and bt are expansions in the variable t=-2 5x 3-1.
For -5x0,
Aix=ft-xgt,  
where f and g are expansions in t=-2 x5 3-1.
For 0<x<4.5,
Aix=e-3x/2yt,  
where y is an expansion in t=4x/9-1.
For 4.5x<9,
Aix=e-5x/2ut,  
where u is an expansion in t=4x/9-3.
For x9,
Aix=e-zvtx1/4,  
where z= 23x3 and v is an expansion in t=2 18z-1.
For x<machine precision, the result is set directly to Ai0. This both saves time and guards against underflow in intermediate calculations.
For large negative arguments, it becomes impossible to calculate the phase of the oscillatory function with any precision and so the routine must fail. This occurs if x<- 32ε 2/3 , where ε is the machine precision.
For large positive arguments, where Ai decays in an essentially exponential manner, there is a danger of underflow so the routine must fail.

4  References

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

5  Parameters

1:     N – INTEGERInput
On entry: n, the number of points.
Constraint: N0.
2:     XN – REAL (KIND=nag_wp) arrayInput
On entry: the argument xi of the function, for i=1,2,,N.
3:     FN – REAL (KIND=nag_wp) arrayOutput
On exit: Aixi, the function values.
4:     IVALIDN – INTEGER arrayOutput
On exit: IVALIDi contains the error code for xi, for i=1,2,,N.
IVALIDi=0
No error.
IVALIDi=1
xi is too large and positive. Fi contains zero. The threshold value is the same as for IFAIL=1 in S17AGF, as defined in the Users' Note for your implementation.
IVALIDi=2
xi is too large and negative. Fi contains zero. The threshold value is the same as for IFAIL=2 in S17AGF, as defined in the Users' Note for your implementation.
5:     IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is 0. When the value -1​ or ​1 is used it is essential to test the value of IFAIL on exit.
On exit: IFAIL=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6  Error Indicators and Warnings

If on entry IFAIL=0 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
IFAIL=1
On entry, at least one value of X was invalid.
Check IVALID for more information.
IFAIL=2
On entry, N=value.
Constraint: N0.
IFAIL=-99
An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.8 in the Essential Introduction for further information.
IFAIL=-399
Your licence key may have expired or may not have been installed correctly.
See Section 3.7 in the Essential Introduction for further information.
IFAIL=-999
Dynamic memory allocation failed.
See Section 3.6 in the Essential Introduction for further information.

7  Accuracy

For negative arguments the function is oscillatory and hence absolute error is the appropriate measure. In the positive region the function is essentially exponential-like and here relative error is appropriate. The absolute error, E, and the relative error, ε, are related in principle to the relative error in the argument, δ, by
E x Aix δ, ε x Aix Aix δ.  
In practice, approximate equality is the best that can be expected. When δ, ε or E is of the order of the machine precision, the errors in the result will be somewhat larger.
For small x, errors are strongly damped by the function and hence will be bounded by the machine precision.
For moderate negative x, the error behaviour is oscillatory but the amplitude of the error grows like
amplitude Eδ x5/4π.  
However the phase error will be growing roughly like 23x3 and hence all accuracy will be lost for large negative arguments due to the impossibility of calculating sin and cos to any accuracy if 23x3> 1δ .
For large positive arguments, the relative error amplification is considerable:
ε δ x3.  
This means a loss of roughly two decimal places accuracy for arguments in the region of 20. However very large arguments are not possible due to the danger of setting underflow and so the errors are limited in practice.

8  Parallelism and Performance

Not applicable.

9  Further Comments

None.

10  Example

This example reads values of X from a file, evaluates the function at each value of xi and prints the results.

10.1  Program Text

Program Text (s17aufe.f90)

10.2  Program Data

Program Data (s17aufe.d)

10.3  Program Results

Program Results (s17aufe.r)


S17AUF (PDF version)
S Chapter Contents
S Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2015