Hi, the workstation of mine is with 32G memery and two 6-core XEON E5-2630 cpu.
I wonder a sparse matrix with about 2million unknowns (roughly 20 million non-zero elements in the matrix) can be solved by the PARDISO within reasonable time.
Thanks a lot!
I'm afraid that the answer is "It depends". Factorization of a highly sparse matrix (yours has a density of 0.000005) can be accompanied by substantial fill-in, and your system is far short of the memory that a dense matrix would take for the same number of unknowns.
You could try smaller problems and run tests to measure how the calculation scales, and project the results to the full size to obtain an estimate the run time.
You can try to use pardiso with iparm(60) is equal to 1. In such case if pardiso need to use more than 32Gb of RAM OOC algorithm will be used. Just set environment variable MKL_PARDISO_OOC_MAX_CORE_SIZE to 30000 to provide information about existence RAM to pardiso before PARDISO call.
With best regards,