c05az locates a simple zero of a continuous function in a given interval by using Brent's method, which is a combination of nonlinear interpolation, linear extrapolation and bisection. It uses reverse communication for evaluating the function.

Syntax

C#
public static void c05az( ref double x, ref double y, double fx, double tolx, int ir, double[] c, ref int ind, out int ifail )

Visual Basic
Public Shared Sub c05az ( _ ByRef x As Double, _ ByRef y As Double, _ fx As Double, _ tolx As Double, _ ir As Integer, _ c As Double(), _ ByRef ind As Integer, _ <OutAttribute> ByRef ifail As Integer _ )

Visual Basic

Public Shared Sub c05az ( _
	ByRef x As Double, _
	ByRef y As Double, _
	fx As Double, _
	tolx As Double, _
	ir As Integer, _
	c As Double(), _
	ByRef ind As Integer, _
	<OutAttribute> ByRef ifail As Integer _
)

Visual C++
public: static void c05az( double% x, double% y, double fx, double tolx, int ir, array<double>^ c, int% ind, [OutAttribute] int% ifail )

F#
static member c05az : x : float byref * y : float byref * fx : float * tolx : float * ir : int * c : float[] * ind : int byref * ifail : int byref -> unit

Parameters

x: Type: System..::..Double%
On initial entry: x and y must define an initial interval $[a, b]$ containing the zero, such that $f (x) \times f (y) \leq 0.0$ . It is not necessary that $x < y$ .
On intermediate exit: x contains the point at which $f$ must be evaluated before re-entry to the method.
On final exit: x and y define a smaller interval containing the zero, such that $f (x) \times f (y) \leq 0.0$ , and $|x - y|$ satisfies the accuracy specified by tolx and ir, unless an error has occurred. If $ifail = 4$ , x and y generally contain very good approximations to a pole; if $ifail = 5$ , x and y generally contain very good approximations to the zero (see [Error Indicators and Warnings]). If a point x is found such that $f (x) = 0.0$ , then on final exit $x = y$ (in this case there is no guarantee that x is a simple zero). In all cases, the value returned in x is the better approximation to the zero.

y: Type: System..::..Double%
On initial entry: x and y must define an initial interval $[a, b]$ containing the zero, such that $f (x) \times f (y) \leq 0.0$ . It is not necessary that $x < y$ .
On intermediate exit: x contains the point at which $f$ must be evaluated before re-entry to the method.
On final exit: x and y define a smaller interval containing the zero, such that $f (x) \times f (y) \leq 0.0$ , and $|x - y|$ satisfies the accuracy specified by tolx and ir, unless an error has occurred. If $ifail = 4$ , x and y generally contain very good approximations to a pole; if $ifail = 5$ , x and y generally contain very good approximations to the zero (see [Error Indicators and Warnings]). If a point x is found such that $f (x) = 0.0$ , then on final exit $x = y$ (in this case there is no guarantee that x is a simple zero). In all cases, the value returned in x is the better approximation to the zero.

fx: Type: System..::..Double
On initial entry: if $ind = 1$ , fx need not be set.
If $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.

tolx: Type: System..::..Double
On initial entry: the accuracy to which the zero is required. The type of error test is specified by ir.

Constraint: $tolx > 0.0$ .

ir

Type: System..::..Int32

On initial entry: indicates the type of error test.

$ir = 0$: The test is: $|x - y| \leq 2.0 \times tolx \times \max (1.0, |x|)$ .
$ir = 1$: The test is: $|x - y| \leq 2.0 \times tolx$ .
$ir = 2$: The test is: $|x - y| \leq 2.0 \times tolx \times |x|$ .

Suggested value:

ir = 0

Constraint:

ir = 0

1

2

c: Type: array<System..::..Double>[]()[][]
An array of size [ $17$ ]
On initial entry: if $ind = 1$ , no elements of c need be set.
If $ind = - 1$ , $c [0]$ must contain $f (y)$ , other elements of c need not be set.

On final exit: is undefined.

ind

Type: System..::..Int32%

On initial entry: must be set to

1

- 1

$ind = 1$: fx and $c [0]$ need not be set.
$ind = - 1$: fx and $c [0]$ must contain $f (x)$ and $f (y)$ respectively.

On intermediate exit: contains

2

3

4

. The calling program must evaluate

f

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

On final exit: contains

0

Constraint: on entry

ind = -1

1

2

3

4

ifail: Type: System..::..Int32%
On initial entry: ifail must be set to $0$ , $- 1 or 1$ . If you are unfamiliar with this parameter you should refer to Library Overview 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, because for this method the values of the output parameters may be useful even if $ifail \neq 0$ on exit, the recommended value is $- 1$ . When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On final exit: $ifail = 0$ unless the method detects an error or a warning has been flagged (see [Error Indicators and Warnings]).

Description

You must supply x and y to define an initial interval

[a, b]

containing a simple zero of the function

f (x)

(the choice of x and y must be such that

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

). The method combines the methods of bisection, nonlinear interpolation and linear extrapolation (see Dahlquist and Björck (1974)), to find a sequence of sub-intervals of the initial interval such that the final interval

[x, y]

contains the zero and

|x - y|

is less than some tolerance specified by tolx and ir (see [Parameters]). In fact, since the intermediate intervals

[x, y]

are determined only so that

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

, it is possible that the final interval may contain a discontinuity or a pole of

f

(violating the requirement that

f

be continuous). c05az checks if the sign change is likely to correspond to a pole of

f

and gives an error return in this case.

A feature of the algorithm used by this method is that unlike some other methods it guarantees convergence within about

{(\log_{2} [(b - a) / δ])}^{2}

function evaluations, where

δ

is related to the parameter tolx. See Brent (1973) for more details.

c05az returns to the calling program for each evaluation of

f (x)

. On each return you should set

fx = f (x)

and call c05az again.

The method is a modified version of procedure ‘zeroin’ given by Brent (1973).

References

Brent R P (1973) Algorithms for Minimization Without Derivatives Prentice–Hall

Bus J C P and Dekker T J (1975) Two efficient algorithms with guaranteed convergence for finding a zero of a function ACM Trans. Math. Software 1 330–345

Dahlquist G and Björck Å (1974) Numerical Methods Prentice–Hall

Error Indicators and Warnings

Errors or warnings detected by the method:

$ifail = 1$: On entry, $f (x)$ and $f (y)$ have the same sign with neither equalling $0.0$ .

$ifail = 2$: On entry, $ind \neq -1$ , $1$ , $2$ , $3$ or $4$ .

$ifail = 3$

On entry,	$tolx \leq 0.0$ ,
or	$ir \neq 0$ , $1$ or $2$ .

$ifail = 4$: An interval $[x, y]$ has been determined satisfying the error tolerance specified by tolx and ir and such that $f (x) \times f (y) \leq 0$ . However, from observation of the values of $f$ during the calculation of $[x, y]$ , it seems that the interval $[x, y]$ contains a pole rather than a zero. Note that this error exit is not completely reliable: the error exit may be taken in extreme cases when $[x, y]$ contains a zero, or the error exit may not be taken when $[x, y]$ contains a pole. Both these cases occur most frequently when tolx is large.

$ifail = 5$: The tolerance tolx is too small for the problem being solved. This indicator is only set when the interval containing the zero has been reduced to one of relative length at most $2 ε$ , where $ε$ is the machine precision, but the exit condition specified by ir is not satisfied. It is unsafe to continue reducing the interval beyond this point, but the final values of x and y returned are accurate approximations to the zero.

$ifail = -9000$: An error occured, see message report.
$ifail = -8000$: Negative dimension for array $〈value〉$
$ifail = -6000$: Invalid Parameters $〈value〉$

Accuracy

The accuracy of the final value x as an approximation of the zero is determined by tolx and ir (see [Parameters]). A relative accuracy criterion (

ir = 2

) should not be used when the initial values x and y are of different orders of magnitude. In this case a change of origin of the independent variable may be appropriate. For example, if the initial interval

[x, y]

is transformed linearly to the interval

[1, 2]

, then the zero can be determined to a precise number of figures using an absolute (

ir = 1

) or relative (

ir = 2

) error test and the effect of the transformation back to the original interval can also be determined. Except for the accuracy check, such a transformation has no effect on the calculation of the zero.

Parallelism and Performance

None.

Further Comments

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

f (x)

between calls to c05az.

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 and, possibly, when

ifail = 5

.) There is no guarantee that the value returned in x corresponds to a simple root 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.

Example

This example calculates a zero of

e^{- x} - x

with an initial interval

[0, 1]

tolx = 1.0E−5

and a mixed error test.

Example program (C#): c05aze.cs

Example program results: c05aze.r