Hello,
I faced a problem in solving sparse linear system of the form:
A*x = b
where:
A - is squared, symmetric and sparse matrix.
note: the matrix A contains only the upper triangular values (in order to
save memory)
b - a vector
x - a vector of variable

I tried:
1. Eigen::SparseLU<Eigen::SparseMatrix<double>, Eigen::COLAMDOrdering<int>>
2. Eigen::ConjugateGradient<Eigen::SparseMatrix<double>, Eigen::Upper>
None of them works well!

Any ideas?

Thanks in advance
Elias

I am not a developer of Eigen,

but what do you mean by not worked?

Greetings Jens