Hi dear friends,
I have a problem in PARDISO solver in MKL. I want exchange my solver with PARDISO to make the code faster, but sadly the factorization takes a long time. the old multigrid solver is not parallel, so i guess that PARDISO should be faster,but it is not. Do youhave any idea why it is not fast?
I would really appreciate your help.

5 posts / 0 new
Last post
For more complete information about compiler optimizations, see our Optimization Notice.


We would like to
help you but we need to have some details about size and type of your matrix,
linkline, and processor and so on. Or could you provide testcase with PARDISO to
reproduce low performance of this solver on our side to investigate problem

With best regards,

Alexander Kalinkin

also it would be helpful to have the same matrixes as you used while you encountered  this problem. Which mkl version you use? and What processor you're using while running that code?regards

Hi dear friend,
I am using a sparse matrix with size of N=898560 and number of non zeros=3546432. i use CSR format for matrix storage. I want to use iterative format of PARDISO, but sadly i think i have implemented it wrongly. I want to know for using iterative case of pardiso do u have any example that which phases of solution should i use? and iterative with preconditioning, which values iparm and dparm should have. I am so confused sadly. I am not advance user of pardiso so i have no idea which values should i put for iparm. I do not want direct solver i want iterative with conjugate gradient preconditioner.

Hi again,
I use MKL 10.2 version with 4 core.

Leave a Comment

Please sign in to add a comment. Not a member? Join today