fixed_point(func, x0, args=(), xtol=1e-08, maxiter=500, method='del2')

Given a function of one or more variables and a starting point, find a fixed point of the function: i.e., where func(x0) == x0 .

Parameters

func : function

Function to evaluate.

x0 : array_like

Fixed point of function.

args : tuple, optional

Extra arguments to :None:None:`func`.

xtol : float, optional

Convergence tolerance, defaults to 1e-08.

maxiter : int, optional

Maximum number of iterations, defaults to 500.

method : {"del2", "iteration"}, optional

Method of finding the fixed-point, defaults to "del2", which uses Steffensen's Method with Aitken's Del^2 convergence acceleration . The "iteration" method simply iterates the function until convergence is detected, without attempting to accelerate the convergence.

Find a fixed point of the function.

Examples

>>> from scipy import optimize
... def func(x, c1, c2):
...    return np.sqrt(c1/(x+c2))
... c1 = np.array([10,12.])
... c2 = np.array([3, 5.])
... optimize.fixed_point(func, [1.2, 1.3], args=(c1,c2))
array([ 1.4920333 ,  1.37228132])

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.optimize._minpack_py.fixed_point scipy.optimize._zeros_py.bisect

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /scipy/optimize/_minpack_py.py#899
type: <class 'function'>
Commit: