# NAG C Library Function Document

## 1Purpose

nag_elliptic_integral_rc (s21bac) returns a value of an elementary integral, which occurs as a degenerate case of an elliptic integral of the first kind.

## 2Specification

 #include #include
 double nag_elliptic_integral_rc (double x, double y, NagError *fail)

## 3Description

nag_elliptic_integral_rc (s21bac) calculates an approximate value for the integral
 $RC x,y = 12 ∫ 0 ∞ dt t+y . t+x$
where $x\ge 0$ and $y\ne 0$.
This function, which is related to the logarithm or inverse hyperbolic functions for $y and to inverse circular functions if $x, arises as a degenerate form of the elliptic integral of the first kind. If $y<0$, the result computed is the Cauchy principal value of the integral.
The basic algorithm, which is due to Carlson (1979) and Carlson (1988), is to reduce the arguments recursively towards their mean by the system:
 $x0=x y0=y μn=xn+2yn/3, Sn=yn-xn/3μn λn=yn+2xnyn xn+1=xn+λn/4, yn+1=yn+λn/4.$
The quantity $\left|{S}_{n}\right|$ for $n=0,1,2,3,\dots \text{}$ decreases with increasing $n$, eventually $\left|{S}_{n}\right|\sim 1/{4}^{n}$. For small enough ${S}_{n}$ the required function value can be approximated by the first few terms of the Taylor series about the mean. That is
 $RCx,y=1+3Sn210+Sn37+3Sn48+9Sn522 /μn.$
The truncation error involved in using this approximation is bounded by $16{\left|{S}_{n}\right|}^{6}/\left(1-2\left|{S}_{n}\right|\right)$ and the recursive process is stopped when ${S}_{n}$ is small enough for this truncation error to be negligible compared to the machine precision.
Within the domain of definition, the function value is itself representable for all representable values of its arguments. However, for values of the arguments near the extremes the above algorithm must be modified so as to avoid causing underflows or overflows in intermediate steps. In extreme regions arguments are prescaled away from the extremes and compensating scaling of the result is done before returning to the calling program.

## 4References

NIST Digital Library of Mathematical Functions
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{x}$doubleInput
2:    $\mathbf{y}$doubleInput
On entry: the arguments $x$ and $y$ of the function, respectively.
Constraint: ${\mathbf{x}}\ge 0.0$ and ${\mathbf{y}}\ne 0.0$.
3:    $\mathbf{fail}$NagError *Input/Output
The NAG error argument (see Section 3.7 in How to Use the NAG Library and its Documentation).

## 6Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 2.3.1.2 in How to Use the NAG Library and its Documentation for further information.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 2.7.6 in How to Use the NAG Library and its Documentation for further information.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 2.7.5 in How to Use the NAG Library and its Documentation for further information.
NE_REAL_ARG_EQ
On entry, ${\mathbf{y}}=0.0$.
Constraint: ${\mathbf{y}}\ne 0.0$.
The function is undefined and returns zero.
NE_REAL_ARG_LT
On entry, ${\mathbf{x}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{x}}\ge 0.0$.
The function is undefined.

## 7Accuracy

In principle the function 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

nag_elliptic_integral_rc (s21bac) is not threaded in any implementation.

You should consult the s Chapter Introduction which shows the relationship of this function to the classical definitions of the elliptic integrals.

## 10Example

This example simply generates a small set of nonextreme arguments which are used with the function to produce the table of low accuracy results.

### 10.1Program Text

Program Text (s21bace.c)

None.

### 10.3Program Results

Program Results (s21bace.r)