Hi,
I am trying to solve a relatively large system (100.000 equations) using either Pardiso or CG.
The system matrix is sparse, symmetric and converted to CSR format. For the matrix-vector multiplication
I use mkl_dcsrsymv for the RCI requests. My question is why Pardiso is way faster than CG?
Shouldn't it be the other way around?
on a quad-core intel xeon it takes around 1 sec for pardiso, while CG needs around 30 sec.
These are the parameters i used on pardiso:
iparm(1) = 1
iparm(2) = 3
iparm(4) = 0
iparm(5) = 0
iparm(6) = 0
iparm(8) = 9
iparm(10) = 13
iparm(11) = 1
iparm(13) = 1
iparm(18) = -1
iparm(19) = -1
iparm(60) = 1