December 2017
Intermediate to advanced
386 pages
10h 42m
English
The following code is required to get ready before we proceed:
scipy.optimize.newton_krylov(F, xin, iter=None, rdiff=None, method='lgmres', inner_maxiter=20, inner_M=None, outer_k=10, verbose=False, maxiter=None, f_tol=None, f_rtol=None, x_tol=None, x_rtol=None, tol_norm=None, line_search='armijo', callback=None, **kw)
In the following table can see the parameters and their description of the Anderson method
| Parameters |
F: function(x) -> f. Function whose root to find; should take and return an array-like object. xin: array_like. Initial guess for the solution. rdiff: float, optional. Relative step size to use in numerical differentiation. method: {'lgmres', 'gmres', 'bicgstab', 'cgs', 'minres'} or function. Krylov method ... |
Read now
Unlock full access