x*A = b is equivalent to A.transpose() * z = b.transpose(); x = z.transpose() which can be solved for x.
Note, that storage operations are cheap in comparison to the solving of the linear system. A is sparse and the sparsity remains the same for the transpose operation. Often, transposition is just a flag and a change in the addressing of the elements. From my first glance into the doc this does not apply to Eigen. But, from what I told you before, this does not matter so much.