cgs(A, b, x0=None, tol=1e-05, maxiter=None, M=None, callback=None, atol=None)
Starting guess for the solution.
Tolerances for convergence, norm(residual) <= max(tol*norm(b), atol)
. The default for atol
is 'legacy'
, which emulates a different legacy behavior.
The default value for :None:None:`atol` will be changed in a future release. For future compatibility, specify :None:None:`atol` explicitly.
Maximum number of iterations. Iteration will stop after maxiter steps even if the specified tolerance has not been achieved.
Preconditioner for A. The preconditioner should approximate the inverse of A. Effective preconditioning dramatically improves the rate of convergence, which implies that fewer iterations are needed to reach a given error tolerance.
User-supplied function to call after each iteration. It is called as callback(xk), where xk is the current solution vector.
The real-valued N-by-N matrix of the linear system. Alternatively, A
can be a linear operator which can produce Ax
using, e.g., scipy.sparse.linalg.LinearOperator
.
Right hand side of the linear system. Has shape (N,) or (N,1).
Use Conjugate Gradient Squared iteration to solve Ax = b
.
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