NAG Library Routine Document

c05axf  (contfn_cntin_rcomm)

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

1:     $\mathbf{x}$ – Real (Kind=nag_wp)Input/Output

On initial entry: an initial approximation to the zero.

On intermediate exit: the point at which $f$ must be evaluated before re-entry to the routine.

On final exit: the final approximation to the zero.

2:     $\mathbf{fx}$ – Real (Kind=nag_wp)Input

On initial entry: if $\mathbf{ind}=1$, fx need not be set.

If $\mathbf{ind}=-1$, fx must contain $f\left(\mathbf{x}\right)$ for the initial value of x.

On intermediate re-entry: must contain $f\left(\mathbf{x}\right)$ for the current value of x.

3:     $\mathbf{tol}$ – Real (Kind=nag_wp)Input

On initial entry: a value that controls the accuracy to which the zero is determined. tol is used in determining the convergence of the secant iteration used at each stage of the continuation process. It is used directly when solving the last problem (${\theta }_m=0$ in Section 3), and $\sqrt{\mathbf{tol}}$ is used for the problem defined by ${\theta }_r$, $r<m$. Convergence to the accuracy specified by tol is not guaranteed, and so you are recommended to find the zero using at least two values for tol to check the accuracy obtained.

Constraint: $\mathbf{tol}>0.0$.

4:     $\mathbf{ir}$ – IntegerInput

On initial entry: indicates the type of error test required, as follows. Solving the problem defined by ${\theta }_r$, $1\le r\le m$, involves computing a sequence of secant iterates $x_r^0,x_r^1,\dots$. This sequence will be considered to have converged only if:

for $\mathbf{ir}=0$,

$$\left|x_r^{\left(i+1\right)}-x_r^{\left(i\right)}\right|\le \mathit{eps}\times \max \left(1.0,\left|x_r^{\left(i\right)}\right|\right)\text{,}$$

for $\mathbf{ir}=1$,

$$\left|x_r^{\left(i+1\right)}-x_r^{\left(i\right)}\right|\le \mathit{eps}\text{,}$$

for $\mathbf{ir}=2$,

$$\left|x_r^{\left(i+1\right)}-x_r^{\left(i\right)}\right|\le \mathit{eps}\times \left|x_r^{\left(i\right)}\right|\text{,}$$

for some $i>1$; here $\mathit{eps}$ is either tol or $\sqrt{\mathbf{tol}}$ as discussed above. Note that there are other subsidiary conditions (not given here) which must also be satisfied before the secant iteration is considered to have converged.

Constraint: $\mathbf{ir}=0$, $1$ or $2$.

5:     $\mathbf{scal}$ – Real (Kind=nag_wp)Input

On initial entry: a factor for use in determining a significant approximation to the derivative of $f\left(x\right)$ at $x=x_0$, the initial value. A number of difference approximations to $f^{\prime }\left(x_0\right)$ are calculated using

$$f^{\prime }\left(x_0\right)\sim \left(f\left(x_0+h\right)-f\left(x_0\right)\right)/h$$

where $\left|h\right|<\left|\mathbf{scal}\right|$ and $h$ has the same sign as scal. A significance (cancellation) check is made on each difference approximation and the approximation is rejected if insignificant.

Suggested value: $\sqrt{\epsilon }$, where $\epsilon$ is the machine precision returned by x02ajf.

Constraint: $\mathbf{scal}$ must be sufficiently large that $\mathbf{x}+\mathbf{scal}\ne \mathbf{x}$ on the computer.

6:     $\mathbf{c}\left(26\right)$ – Real (Kind=nag_wp) arrayCommunication Array

($\mathbf{c}\left(5\right)$ contains the current ${\theta }_r$, this value may be useful in the event of an error exit.)

7:     $\mathbf{ind}$ – IntegerInput/Output

On initial entry: must be set to $1$ or $-1$.

$\mathbf{ind}=1$

fx need not be set.

$\mathbf{ind}=-1$

fx must contain $f\left(\mathbf{x}\right)$.

On intermediate exit: contains $2$, $3$ or $4$. The calling program must evaluate $f$ at x, storing the result in fx, and re-enter c05axf with all other arguments unchanged.

On final exit: contains $0$.

Constraint: on entry $\mathbf{ind}=-1$, $1$, $2$, $3$ or $4$.

Note: any values you return to c05axf as part of the reverse communication procedure should not include floating-point NaN (Not a Number) or infinity values, since these are not handled by c05axf. If your code inadvertently does return any NaNs or infinities, c05axf is likely to produce unexpected results.

8:     $\mathbf{ifail}$ – IntegerInput/Output

On initial 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, because for this routine the values of the output arguments may be useful even if $\mathbf{ifail}\ne \mathbf{0}$ on exit, the recommended value is $-1$. When the value $-\mathbf{1}\text{ or }1$ is used it is essential to test the value of ifail on exit.

On final exit: $\mathbf{ifail}=\mathbf{0}$ unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

$\mathbf{ifail}=1$

On entry,	$\mathbf{tol}\le 0.0$,
or	$\mathbf{ir}\ne 0$, $1$ or $2$.

$\mathbf{ifail}=2$

The argument ind is incorrectly set on initial or intermediate entry.

$\mathbf{ifail}=3$

scal is too small, or significant derivatives of $f$ cannot be computed (this can happen when $f$ is almost constant and nonzero, for any value of scal).

$\mathbf{ifail}=4$

The current problem in the continuation sequence cannot be solved, see $\mathbf{c}\left(5\right)$ for the value of ${\theta }_r$. The most likely explanation is that the current problem has no solution, either because the original problem had no solution or because the continuation path passes through a set of insoluble problems. This latter reason for failure should occur rarely, and not at all if the initial approximation to the zero is sufficiently close. Other possible explanations are that tol is too small and hence the accuracy requirement is too stringent, or that tol is too large and the initial approximation too poor, leading to successively worse intermediate solutions.

$\mathbf{ifail}=5$

Continuation away from the initial point is not possible. This error exit will usually occur if the problem has not been properly posed or the error requirement is extremely stringent.

$\mathbf{ifail}=6$

The final problem (with ${\theta }_m=0$) cannot be solved. It is likely that too much accuracy has been requested, or that the zero is at $\alpha =0$ and $\mathbf{ir}=2$.

$\mathbf{ifail}=-99$

An unexpected error has been triggered by this routine. Please contact NAG.

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.

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

Program Text (c05axfe.f90)

10.2

Program Data

10.3

Program Results

Program Results (c05axfe.r)