new_muller

sherpa.utils.new_muller(fcn, xa, xb, fa=None, fb=None, args=(), maxfev=32, tol=1e-06)

Alternative implementation of Mueller’s method for root finding

Parameters:

fcncallable()

The function with a root. The function signature is fcn(x, *args).

xa, xb: float

Muller’s method requires three initial values.

fa, fb: float or None

Function values at xa and xb. These parameters are optional and can be passed to save time in cases where fcn(xa, *args) is already known and function evaluation takes a long time. If None, they will be calculated.

argstuple

Additional parameters that will be passed through to fcn.

maxfevint

Maximal number of function evaluations

tolfloat

The root finding algorithm stops if the function value a value x with abs(fcn(x)) < tol is found.

Returns:

outlist

The output has the form of a list: [[x, fcn(x)], [x1, fcn(x1)], [x2, fcn(x2)], nfev] where x is the location of the root, and x1 and x2 are the previous steps. The function value for those steps is returned as well. nfev is the total number of function evaluations. If any of those values is not available, None will be returned instead.