Hello,

i'm using Pardiso to solve a real unsymmetrical problem with very large matrix

( n=40 000 ), 3% non-zeros (45 986 096) and 1 rhs.

I'm quite disappointed about the times of calculation : on my computer (8 CPUs, 16432032 KB total memory, 1595 MHz), it takes 35 min. Does it seem normal to you?

I haven't found any comparison of performance related to the size of the matrix...

Maybe my iparms are not optimized for my problem :

iparm[0] = 1; /* No solver default */

iparm[1] = 2; /* Fill-in reordering from METIS */

iparm[2] = 8;

iparm[3] = 31; /* CGS */

iparm[4] = 0; /* No user fill-in reducing permutation */

iparm[5] = 0; /* Write solution into x */

iparm[6] = 0; /* Not in use */

iparm[7] = 0; /* Max numbers of iterative refinement steps */

iparm[8] = 0; /* Not in use */

iparm[9] = 13; /* Perturb the pivot elements with 1E-13 */

iparm[10] = 1; /* Use nonsymmetric permutation and scaling MPS */

iparm[11] = 0; /* Not in use */

iparm[12] = 0; /* Not in use */

iparm[13] = 0; /* Output: Number of perturbed pivots */

iparm[14] = 0; /* Not in use */

iparm[15] = 0; /* Not in use */

iparm[16] = 0; /* Not in use */

iparm[17] = -1; /* Output: Number of nonzeros in the factor LU */

iparm[18] = -1; /* Output: Mflops for LU factorization */

iparm[19] = 0; /* Output: Numbers of CG Iterations */

iparm[31] = 1; /* iterative solver*/

iparm[60] = 2; /* Out-of-Core resolution */

Thanks for any help you can give me

Yannick

p.s : I don't know where to find the version of pardiso ( is not in mkl_pardiso.h)