c05avc attempts to locate an interval containing a simple zero of a continuous function using a binary search. It uses reverse communication for evaluating the function.

2 Specification

#include <nag.h>

void	c05avc (double x, double fx, double h, double boundl, double boundu, double y, double c[], Integer ind, NagError *fail)

The function may be called by the names: c05avc, nag_roots_contfn_interval_rcomm or nag_interval_zero_cont_func.

3 Description

You must supply an initial point x and a step h. c05avc attempts to locate a short interval

[x, y] \subset [boundl, boundu]

containing a simple zero of

f (x)

(On exit we may have

x > y

; x is determined as the first point encountered in a binary search where the sign of

f (x)

differs from the sign of

f (x)

at the initial input point x.) The function attempts to locate a zero of

f (x)

using h,

0.1 \times h

0.01 \times h

and

0.001 \times h

in turn as its basic step before quitting with an error exit if unsuccessful.

c05avc returns to the calling program for each evaluation of

f (x)

. On each return you should set

fx = f (x)

and call c05avc again.

4 References

None.

5 Arguments

Note: this function uses reverse communication. Its use involves an initial entry, intermediate exits and re-entries, and a final exit, as indicated by the argument ind. Between intermediate exits and re-entries, all arguments other than fx must remain unchanged.

1: $x$ – double * Input/Output

On initial entry: the best available approximation to the zero.

Constraint: x must lie in the closed interval

[boundl, boundu]

(see below).

On intermediate exit: contains the point at which

f

must be evaluated before re-entry to the function.

On final exit: contains one end of an interval containing the zero, the other end being in y, unless an error has occurred. If

fail . code =

NE_ZERO_NOT_FOUND, x and y are the end points of the largest interval searched. If a zero is located exactly, its value is returned in x (and in y).

2: $fx$ – double Input

On initial entry: if

ind = 1

, fx need not be set.

ind = - 1

, fx must contain

f (x)

for the initial value of x.

On intermediate re-entry: must contain

f (x)

for the current value of x.

3: $h$ – double * Input/Output

On initial entry: a basic step size which is used in the binary search for an interval containing a zero. The basic step sizes

h, 0.1 \times h

0.01 \times h

and

0.001 \times h

are used in turn when searching for the zero.

Constraint: either

x + h

x - h

must lie inside the closed interval

[boundl, boundu]

h must be sufficiently large that

x + h \neq x

on the computer.

On final exit: is undefined.

4: $boundl$ – double Input

5: $boundu$ – double Input

On initial entry: boundl and boundu must contain respectively lower and upper bounds for the interval of search for the zero.

Constraint:

boundl < boundu

6: $y$ – double * Input/Output

On initial entry: need not be set.

On final exit: contains the closest point found to the final value of x, such that

f (x) \times f (y) \leq 0.0

. If a value x is found such that

f (x) = 0

y = x

. On final exit with

fail . code =

NE_ZERO_NOT_FOUND, x and y are the end points of the largest interval searched.

7: $c [11]$ – double Communication Array

On initial entry: need not be set.

On final exit: if

fail . code =

NE_NOERROR or NE_ZERO_NOT_FOUND,

c [0]

contains

f (y)

8: $ind$ – Integer * Input/Output

On initial entry: must be set to

1

- 1

$ind = 1$: fx need not be set.
$ind = - 1$: fx must contain $f (x)$ .

On intermediate exit: contains

2

3

. The calling program must evaluate

f

at x, storing the result in fx, and re-enter c05avc with all other arguments unchanged.

On final exit: contains

0

Constraint: on entry

ind = - 1

1

2

3

Note: any values you return to c05avc 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 c05avc. If your code inadvertently does return any NaNs or infinities, c05avc is likely to produce unexpected results.

9: $fail$ – NagError * Input/Output

The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM: On entry, argument $〈value〉$ had an illegal value.
NE_INT: On entry, $ind = 〈value〉$ .
Constraint: $ind = - 1$ , $1$ , $2$ or $3$ .
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 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
NE_REAL_2: On entry, $boundl = 〈value〉$ and $boundu = 〈value〉$ .
Constraint: $boundl < boundu$ .

On entry, $x = 〈value〉$ and $h = 〈value〉$ .
Constraint: h must be sufficiently large that $x + h \neq x$ on the computer.
NE_REAL_3: On entry, $x = 〈value〉$ , $boundl = 〈value〉$ and $boundu = 〈value〉$ .
Constraint: $boundl \leq x \leq boundu$ .
NE_REAL_4: On entry, $x = 〈value〉$ , $h = 〈value〉$ , $boundl = 〈value〉$ and $boundu = 〈value〉$ .
Constraint: either $x + h$ or $x - h$ must lie inside the closed interval $[boundl, boundu]$ .
NE_ZERO_NOT_FOUND: An interval containing the zero could not be found. Try restarting with modified x and h.

7 Accuracy

c05avc is not intended to be used to obtain accurate approximations to the zero of

f (x)

but rather to locate an interval containing a zero. This interval can then be used as input to an accurate rootfinder such as c05ayc or c05azc. The size of the interval determined depends somewhat unpredictably on the choice of x and h. The closer x is to the root and the smaller the initial value of h, then, in general, the smaller (more accurate) the interval determined; however, the accuracy of this statement depends to some extent on the behaviour of

f (x)

near

x = x

and on the size of h.

8 Parallelism and Performance

c05avc is not threaded in any implementation.

9 Further Comments

For most problems, the time taken on each call to c05avc will be negligible compared with the time spent evaluating

f (x)

between calls to c05avc. However, the initial value of x and h will clearly affect the timing. The closer x is to the root, and the larger the initial value of h then the less time taken. (However taking a large h can affect the accuracy and reliability of the function, see below.)

You are expected to choose boundl and boundu as physically (or mathematically) realistic limits on the interval of search. For example, it may be known, from physical arguments, that no zero of

f (x)

of interest will lie outside

[boundl, boundu]

. Alternatively,

f (x)

may be more expensive to evaluate for some values of x than for others and such expensive evaluations can sometimes be avoided by careful choice of boundl and boundu.

The choice of boundl and boundu affects the search only in that these values provide physical limitations on the search values and that the search is terminated if it seems, from the available information about

f (x)

, that the zero lies outside

[boundl, boundu]

. In this case (

fail . code =

NE_ZERO_NOT_FOUND on exit), only one of

f (boundl)

and

f (boundu)

may have been evaluated and a zero close to the other end of the interval could be missed. The actual interval searched is returned in the arguments x and y and you can call c05avc again to search the remainder of the original interval.

Though c05avc is intended primarily for determining an interval containing a zero of

f (x)

, it may be used to shorten a known interval. This could be useful if, for example, a large interval containing the zero is known and it is also known that the root lies close to one end of the interval; by setting x to this end of the interval and h small, a short interval will usually be determined. However, it is worth noting that once any interval containing a zero has been determined, a call to c05azc will usually be the most efficient way to calculate an interval of specified length containing the zero. To assist in this determination, the information in fx and in x, y and

c [0]

on successful exit from c05avc is in the correct form for a call to function c05azc with

ind = - 1

If the calculation terminates because

f (x) = 0.0

, then on return y is set to x. (In fact,

y = x

on return only in this case.) In this case, there is no guarantee that the value in x corresponds to a simple zero and you should check whether it does.

One way to check this is to compute the derivative of

f

at the point x, preferably analytically, or, if this is not possible, numerically, perhaps by using a central difference estimate. If

f^{'} (x) = 0.0

, then x must correspond to a multiple zero of

f

rather than a simple zero.

10 Example

This example finds a sub-interval of

[0.0, 4.0]

containing a simple zero of

x^{2} - 3 x + 2

. The zero nearest to

3.0

is required and so we set

x = 3.0

initially.

10.1 Program Text

Program Text (c05avce.c)

10.2 Program Data

None.

10.3 Program Results

Program Results (c05avce.r)

NAG Library Manual, Mark 27

Interfaces: FL CL AD

NAG CL Interface Introduction

C05 (Roots) Chapter Contents

C05 (Roots) Chapter Introduction

c05av: FL CL AD

NAG CL Interfacec05avc (contfn_​interval_​rcomm)

▸▿ Contents

1 Purpose