Hello
I am wondering if eigen could be able to compute something like A^(-1) * B where both A and B are sparse matrices.
Thanks, eigen is awesome!

yes, if A is symmetric we have both direct (SimplicialLDLt) and iterative (ConjugateGradient) solvers, and if not then we have a built-in iterative solver (BiCGSTAB) and wrapper to SuperLU and UmfPack (fast direct solvers).