I am attempting to solve a large complex, symmetric matrix using PARDISO. The matrix has approximately 1,000,000 equations, and 91,000,000 non-zeros. I suspect that during Pardiso's factorization stage, the number of non-zeroes in the factors exceed the 32-bit integer size limit (i.e. 2^31). I suspect this because pardiso returns a very large negative number for iparm(18), after the factorization stage.
So ... here's the questions.