bisection

distance of successive iterations at which algorithm
 terminates.

Applies the bisection algorithm to find x such that ftn(x) == x.

 optimize 

Provides functions and datasets from Jones, O.D., R. Maillardet, and A.P. Robinson.  2014.  An Introduction to Scientific Programming and Simulation, Using R. 2nd Ed. Chapman And Hall/CRC.

Andrew Robinson  Joseph M Hilbe
        hilbeasuedu

spuRs

Functions and Datasets for "Introduction to Scientific
Programming and Simulation Using R"

bisection function

<dl> <dt>ftn</dt>
<dd>the function.</dd> <dt>x.l</dt>
<dd>is the lower starting point.</dd> <dt>x.r</dt>
<dd>is the upper starting point.</dd> <dt>tol</dt>
<dd>distance of successive iterations at which algorithm
 terminates.</dd></dl>

Arguments

A function of the bisection algorithm. — bisection

<dl>

 <dt>ftn</dt>
<dd>the function.</dd>

 <dt>x.l</dt>
<dd>is the lower starting point.</dd>

 <dt>x.r</dt>
<dd>is the upper starting point.</dd>

 <dt>tol</dt>
<dd>distance of successive iterations at which algorithm
 terminates.</dd>

</dl>

bisection: A function of the bisection algorithm.

Description

Usage

Value

Arguments

Details

References

See Also

Examples