nonlin_solve(F, x0, jacobian='krylov', iter=None, verbose=False, maxiter=None, f_tol=None, f_rtol=None, x_tol=None, x_rtol=None, tol_norm=None, line_search='armijo', callback=None, full_output=False, raise_exception=True)
This algorithm implements the inexact Newton method, with backtracking or full line searches. Several Jacobian approximations are available, including Krylov and Quasi-Newton methods.
Function whose root to find; should take and return an array-like object.
Initial guess for the solution
A Jacobian approximation: Jacobian
object or something that asjacobian
can transform to one. Alternatively, a string specifying which of the builtin Jacobian approximations to use:
krylov, broyden1, broyden2, anderson diagbroyden, linearmixing, excitingmixing
Number of iterations to make. If omitted (default), make as many as required to meet tolerances.
Print status to stdout on every iteration.
Maximum number of iterations to make. If more are needed to meet convergence, NoConvergence
is raised.
Absolute tolerance (in max-norm) for the residual. If omitted, default is 6e-6.
Relative tolerance for the residual. If omitted, not used.
Absolute minimum step size, as determined from the Jacobian approximation. If the step size is smaller than this, optimization is terminated as successful. If omitted, not used.
Relative minimum step size. If omitted, not used.
Norm to use in convergence check. Default is the maximum norm.
Which type of a line search to use to determine the step size in the direction given by the Jacobian approximation. Defaults to 'armijo'.
Optional callback function. It is called on every iteration as callback(x, f)
where x is the current solution and f the corresponding residual.
When a solution was not found.
If true, returns a dictionary :None:None:`info` containing convergence information.
If True, a NoConvergence
exception is raise if no solution is found.
An array (of similar array type as :None:None:`x0`) containing the final solution.
Find a root of a function, in a way suitable for large-scale problems.
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.optimize._nonlin._nonlin_wrapper
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