Summary PARDISO: ( factorize to factorize )
================
Times:
======
Time A to LU: 0.000000 s
Factorization: Time for writing to files : 0.000000
Factorization: Time for reading from files : 0.000000
Time numfct : 663.914768 s
Time malloc : 0.000054 s
Time total : 663.954133 s total - sum: 0.039310 s
Statistics:
===========
< Parallel Direct Factorization with #processors: > 8
< Numerical Factorization with BLAS3 and O(n) synchronization >
< Linear system Ax = b>
#equations: 5389726
#non-zeros in A: 42250735
non-zeros in A (%): 0.000145
#right-hand sides: 1
< Factors L and U >
#columns for each panel: 96
#independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
#supernodes: 2241484
size of largest supernode: 9951
number of nonzeros in L 3046299967
number of nonzeros in U 1
number of nonzeros in L+U 3046299968
gflop for the numerical factorization: 11175.376693
gflop/s for the numerical factorization: 16.832547
Link Copied
Hi,
Could you provide us with the following info:
What the iparm(60) do you set? What MKL_PARDISO_OOC_MAX_CORE_SIZE do you set and how much RAM your system has?
Regards, Sergey
A: DOUBLE PRECISION - for real types of matrices (mtype=1,2, -2 and 11) and for double precision PARDISO (iparm(28)=0)
REAL - for real types of matrices (mtype=1, 2, -2 and 11) and for single precision PARDISO (iparm(28)=1)
Regards,
Sergey
For more complete information about compiler optimizations, see our Optimization Notice.