_cg(A, b, x0=None, tol=1e-10, maxiter=1000)
A must have been compressed before by compress_csc or compress_csr method.
Right hand side of the linear system.
Starting guess for the solution. Defaults to the zero vector.
Tolerance to achieve. The algorithm terminates when the relative residual is below tol. Default is 1e-10.
Maximum number of iterations. Iteration will stop after maxiter steps even if the specified tolerance has not been achieved. Defaults to 1000.
Use Preconditioned Conjugate Gradient iteration to solve A x = b A simple Jacobi (diagonal) preconditionner is used.
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