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

NAG Library Routine Document

S21CAF

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

S21CAF evaluates the Jacobian elliptic functions sn, cn and dn.

2  Specification

SUBROUTINE S21CAF ( U, M, SN, CN, DN, IFAIL)
INTEGER  IFAIL
REAL (KIND=nag_wp)  U, M, SN, CN, DN

3  Description

S21CAF evaluates the Jacobian elliptic functions of argument u and parameter m,
snum = sinϕ, cnum = cosϕ, dnum = 1-msin2ϕ,  
where ϕ, called the amplitude of u, is defined by the integral
u=0ϕdθ 1-msin2θ .  
The elliptic functions are sometimes written simply as snu, cnu and dnu, avoiding explicit reference to the parameter m.
Another nine elliptic functions may be computed via the formulae
cdu = cnu/dnu sdu = snu/dnu ndu = 1/dnu dcu = dnu/cnu ncu = 1/cnu scu = snu/cnu nsu = 1/snu dsu = dnu/snu csu = cnu/snu  
(see Abramowitz and Stegun (1972)).
S21CAF is based on a procedure given by Bulirsch (1960), and uses the process of the arithmetic-geometric mean (16.9 in Abramowitz and Stegun (1972)). Constraints are placed on the values of u and m in order to avoid the possibility of machine overflow.

4  References

Abramowitz M and Stegun I A (1972) Handbook of Mathematical Functions (3rd Edition) Dover Publications
Bulirsch R (1960) Numerical calculation of elliptic integrals and elliptic functions Numer. Math. 7 76–90

5  Parameters

1:     U – REAL (KIND=nag_wp)Input
2:     M – REAL (KIND=nag_wp)Input
On entry: the argument u and the parameter m of the functions, respectively.
Constraints:
  • absU λ , where λ = 1 / X02AMF;
  • if absU < 1 / λ , absM λ .
3:     SN – REAL (KIND=nag_wp)Output
4:     CN – REAL (KIND=nag_wp)Output
5:     DN – REAL (KIND=nag_wp)Output
On exit: the values of the functions snu, cnu and dnu, respectively.
6:     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,absU>λ, where λ=1/X02AMF.
IFAIL=2
On entry,absM>λ and absU<1/λ.
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

In principle the routine is capable of achieving full relative precision in the computed values. However, the accuracy obtainable in practice depends on the accuracy of the standard elementary functions such as SIN and COS.

8  Parallelism and Performance

Not applicable.

9  Further Comments

None.

10  Example

This example reads values of the argument u and parameter m from a file, evaluates the function and prints the results.

10.1  Program Text

Program Text (s21cafe.f90)

10.2  Program Data

Program Data (s21cafe.d)

10.3  Program Results

Program Results (s21cafe.r)


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

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