Hi,

I'm using ConjugateGradient in IterativeLinearSolvers for cholesky factorization.
It works well as a linear solver.

But sometimes, I need the lower (or upper) triangle matrix itself.
Is there any features or tricks to get it just like matrixL() or getL()?

Thank you very much in advance.

CG is an iterative method which directly solves for Ax=b without factorizing the matrix A, unlike a Cholesky-based solver. So there is no such 'L' factors! Check out the SimplicialLLT solver of the SparseCholesky module for that.

Thank you so much!