I have a sparse $2\times10^5$ by $2\times10^5$ matrix with $3.2\times10^9$ non-zero elements.
I want a sparse solver with out-of-core functionality. I have attempted to use Intel's
MKL pardiso, with a varying degree of success. For smaller problems, it is stellar, but for the problem size above, it is taking a huge amount of
RAM (even with the out-of-core enabled), presumably during fill-in reducing ordering stage.
intel staff has been incredibly helpful with debugging several problems, but I feel that it might be prudent to try a different solver.
Is there any good reference comparing the performance of solvers for big problems?