# NAG Library Routine Document

## 1Purpose

s21bjf returns a value of the classical (Legendre) form of the complete elliptic integral of the second kind, via the function name.

## 2Specification

Fortran Interface
 Function s21bjf ( dm,
 Real (Kind=nag_wp) :: s21bjf Integer, Intent (Inout) :: ifail Real (Kind=nag_wp), Intent (In) :: dm
#include nagmk26.h
 double s21bjf_ (const double *dm, Integer *ifail)

## 3Description

s21bjf calculates an approximation to the integral
 $Em = ∫0 π2 1-m sin2⁡θ 12 dθ ,$
where $m\le 1$.
The integral is computed using the symmetrised elliptic integrals of Carlson (Carlson (1979) and Carlson (1988)). The relevant identity is
 $Em = RF 0,1-m,1 - 13 mRD 0,1-m,1 ,$
where ${R}_{F}$ is the Carlson symmetrised incomplete elliptic integral of the first kind (see s21bbf) and ${R}_{D}$ is the Carlson symmetrised incomplete elliptic integral of the second kind (see s21bcf).

## 4References

Abramowitz M and Stegun I A (1972) Handbook of Mathematical Functions (3rd Edition) Dover Publications
Carlson B C (1979) Computing elliptic integrals by duplication Numerische Mathematik 33 1–16
Carlson B C (1988) A table of elliptic integrals of the third kind Math. Comput. 51 267–280

## 5Arguments

1:     $\mathbf{dm}$ – Real (Kind=nag_wp)Input
On entry: the argument $m$ of the function.
Constraint: ${\mathbf{dm}}\le 1.0$.
2:     $\mathbf{ifail}$ – IntegerInput/Output
On entry: ifail must be set to $0$, $-1\text{​ or ​}1$. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{​ 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 argument, the recommended value is $0$. When the value $-\mathbf{1}\text{​ or ​}\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit: ${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6Error Indicators and Warnings

If on entry ${\mathbf{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:
${\mathbf{ifail}}=1$
On entry, ${\mathbf{dm}}=〈\mathit{\text{value}}〉$; the integral is undefined.
Constraint: ${\mathbf{dm}}\le 1.0$.
${\mathbf{ifail}}=-99$
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

## 7Accuracy

In principle s21bjf is capable of producing full machine precision. However round-off errors in internal arithmetic will result in slight loss of accuracy. This loss should never be excessive as the algorithm does not involve any significant amplification of round-off error. It is reasonable to assume that the result is accurate to within a small multiple of the machine precision.

## 8Parallelism and Performance

s21bjf is not threaded in any implementation.

You should consult the S Chapter Introduction, which shows the relationship between this routine and the Carlson definitions of the elliptic integrals. In particular, the relationship between the argument-constraints for both forms becomes clear.
For more information on the algorithms used to compute ${R}_{F}$ and ${R}_{D}$, see the routine documents for s21bbf and s21bcf, respectively.

## 10Example

This example simply generates a small set of nonextreme arguments that are used with the routine to produce the table of results.

### 10.1Program Text

Program Text (s21bjfe.f90)

None.

### 10.3Program Results

Program Results (s21bjfe.r)

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