I am comparing pardiso performance on matrix (size 2500 rows with about 8000 non-zeros). The matrix is concentrated with entries clustered around the diagonal with some values sprinkled sparsely.
I am comparing performance with Kundert's sparse matrix (used for circuit simulation software SPICE http://sparse.sourceforge.net/). The performance of PARDISO is more than a order of magnitude WORSE than Kunderts.
I wanted to know if this is expected or if there are tuning that I can do to PARDISO input to take advantage of the matrix structure
I can post the data files and code if needed. Thanks