_root_leastsq(fun, x0, args=(), jac=None, col_deriv=0, xtol=1.49012e-08, ftol=1.49012e-08, gtol=0.0, maxiter=0, eps=0.0, factor=100, diag=None, **unknown_options)
non-zero to specify that the Jacobian function computes derivatives down the columns (faster, because there is no transpose operation).
Relative error desired in the sum of squares.
Relative error desired in the approximate solution.
Orthogonality desired between the function vector and the columns of the Jacobian.
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 x0.
A suitable step length for the forward-difference approximation of the Jacobian (for Dfun=None). If epsfcn 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 interval (0.1, 100)
.
N positive entries that serve as a scale factors for the variables.
Solve for least squares with Levenberg-Marquardt
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