Determines a zero of a 1D function in a given interval. The function has to be continuous and has to have different signs at the end points of the interval. You must manually select the polymorphic instance to use.


icon

Given the function f(x) with f(a)*f(b) < 0, Ridders' method determines c = (a + b)/2 and calculates the new guess using the following equation:

The values start, cnew, and end are the base for the new iteration, depending on which of the following inequalities is true:

f(start) · f(cnew) < 0 f(cnew) · f(end) < 0

The algorithm stops if |a – b| < accuracy.

Ridders' method is very fast and reliable.

Examples

Refer to the following example files included with LabVIEW.

  • labview\examples\Mathematics\Scripts and Formulas\Street Illumination Problem.vi