=== PARDISO is running in In-Core mode, because iparam(60)=0 === Percentage of computed non-zeros for LL^T factorization 0 % 56 % 99 % 100 % ================ PARDISO: solving a real nonsymmetric system ================ The local (internal) PARDISO version is : 103000115 0-based array is turned ON PARDISO double precision computation is turned ON Parallel METIS algorithm at reorder step is turned ON Single-level factorization algorithm is turned ON Summary PARDISO: ( reorder to solve ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait(fulladj): 0.030409 s Time spent in reordering of the initial matrix(reorder) : 0.123375 s Time spent in symbolic factorization(symbfct) : 0.047455 s Time spent in data preparations for factorization(parlist) : 0.002183 s Time spent in copying matrix to internal data structure(A to LU): 0.000000 s Time spent in factorization step(numfct) : 0.375506 s Time spent in direct solver at solve step (solve) : 0.008262 s Time spent in in allocation of internal data structures(malloc) : 0.143119 s Time spent in additional calculations : 0.306360 s Total time spent : 1.036669 s Statistics: =========== < Parallel Direct Factorization with #processors: > 8 < Numerical Factorization with BLAS3 and O(n) synchronization > < Linear system Ax = b> #equations: 29638 #non-zeros in A: 817102 non-zeros in A (): 0.093020 #right-hand sides: 1 < Factors L and U > #columns for each panel: 72 #independent subgraphs: 0 #supernodes: 7530 size of largest supernode: 660 number of nonzeros in L 3013076 number of nonzeros in U 2563394 number of nonzeros in L+U 5576470 gflop for the numerical factorization: 1.268572 gflop/s for the numerical factorization: 3.378299