_root_hybr(func, x0, args=(), jac=None, col_deriv=0, xtol=1.49012e-08, maxfev=0, band=None, eps=None, factor=100, diag=None, **unknown_options)
Specify whether the Jacobian function computes derivatives down the columns (faster, because there is no transpose operation).
The calculation will terminate if the relative error between two consecutive iterates is at most :None:None:`xtol`.
The maximum number of calls to the function. If zero, then 100*(N+1)
is the maximum where N is the number of elements in :None:None:`x0`.
If set to a two-sequence containing the number of sub- and super-diagonals within the band of the Jacobi matrix, the Jacobi matrix is considered banded (only for fprime=None
).
A suitable step length for the forward-difference approximation of the Jacobian (for fprime=None
). If :None:None:`eps` is less than the machine precision, it is assumed that the relative errors in the functions are of the order of the machine precision.
A parameter determining the initial step bound ( factor * || diag * x||
). Should be in the interval (0.1, 100)
.
N positive entries that serve as a scale factors for the variables.
Find the roots of a multivariate function using MINPACK's hybrd and hybrj routines (modified Powell method).
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