cr.sparse.opt.pcg.solve

cr.sparse.opt.pcg.solve(A, b, max_iters=20, tol=0.0001, atol=0.0, M=<function _identity>)

Solves the problem \(Ax = b\) for a symmetric positive definite \(A\) via preconditioned conjugate gradients iterations with a preconditioner.