Hi, I am trying to solve A*x = B. where both A and B are sparse. Furthermore, A is symmetric also. Seems that since A is symmetric, then I don't need to use those backend solvers such as UmfPack or superLU mentioned in

http://eigen.tuxfamily.org/api/TutorialSparse.html

Then is there any other functions already implemented in eigen that can solve my problem? I really don't want to download or link to other libraries...

Further more, how do I calculate the eigenvalues of the symmetric sparse matrix in eigen?


Thanks

After looking through the class references, I found several functions interesting.
SimplicialLDLt, SimplicialLLt, SparseLLT and SparseLDLT. Do these functions need any backend libraries? What about SparseLU?

Thanks

The documentation about sparse stuff is not really uptodate. In your case use one of the Simplicial* classes or the iterative ConjugateGradient<> solver (from the IterativeSolvers module).

The Sparse* solver are deprecated.