cr.sparse.opt.pcg.solve_from

cr.sparse.opt.pcg.solve_from(A, b, x0, 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 an initial guess and a preconditioner.