./wfes 79999 100528321 === PARDISO: solving a real nonsymmetric system === 0-based array is turned ON PARDISO double precision computation is turned ON Parallel METIS algorithm at reorder step is turned ON Scaling is turned ON Matching is turned ON Summary: ( reordering phase ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait (fulladj): 2.745407 s Time spent in reordering of the initial matrix (reorder) : 8.662030 s Time spent in symbolic factorization (symbfct) : 12.916806 s Time spent in data preparations for factorization (parlist) : 0.058007 s Time spent in allocation of internal data structures (malloc) : 956.924058 s Time spent in additional calculations : 9.028364 s Total time spent : 990.334672 s Statistics: =========== Parallel Direct Factorization is running on 16 OpenMP < Linear system Ax = b > number of equations: 79999 number of non-zeros in A: 100528321 number of non-zeros in A (%): 1.570794 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 72 number of independent subgraphs: 0 number of supernodes: 16760 size of largest supernode: 5224 number of non-zeros in L: 275530542 number of non-zeros in U: 271283135 number of non-zeros in L+U: 546813677 === PARDISO is running in In-Core mode, because iparam(60)=1 and there is enough RAM for In-Core === Percentage of computed non-zeros for LL^T factorization 0 1 2 3 4 5 6 7 9 10 11 12 13 14 15 16 18 19 20 21 22 23 25 26 28 29 30 33 35 37 38 39 40 42 43 44 46 48 49 50 51 53 54 56 57 58 59 60 61 63 64 66 67 68 69 71 73 74 75 76 77 78 80 81 83 85 86 88 89 90 92 93 95 97 98 99 100 === PARDISO: solving a real nonsymmetric system === Single-level factorization algorithm is turned ON Summary: ( factorization phase ) ================ Times: ====== Time spent in copying matrix to internal data structure (A to LU): 0.000001 s Time spent in factorization step (numfct) : 26.428603 s Time spent in allocation of internal data structures (malloc) : 0.002634 s Time spent in additional calculations : 0.000005 s Total time spent : 26.431243 s Statistics: =========== Parallel Direct Factorization is running on 16 OpenMP < Linear system Ax = b > number of equations: 79999 number of non-zeros in A: 100528321 number of non-zeros in A (%): 1.570794 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 72 number of independent subgraphs: 0 number of supernodes: 16760 size of largest supernode: 5224 number of non-zeros in L: 275530542 number of non-zeros in U: 271283135 number of non-zeros in L+U: 546813677 gflop for the numerical factorization: 2112.127917 gflop/s for the numerical factorization: 79.918258 === PARDISO: solving a real nonsymmetric system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.177819 s Time spent in additional calculations : 0.432437 s Total time spent : 0.610256 s Statistics: =========== Parallel Direct Factorization is running on 16 OpenMP < Linear system Ax = b > number of equations: 79999 number of non-zeros in A: 100528321 number of non-zeros in A (%): 1.570794 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 72 number of independent subgraphs: 0 number of supernodes: 16760 size of largest supernode: 5224 number of non-zeros in L: 275530542 number of non-zeros in U: 271283135 number of non-zeros in L+U: 546813677 gflop for the numerical factorization: 2112.127917 gflop/s for the numerical factorization: 79.918258 === PARDISO: solving a real nonsymmetric system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.177819 s Time spent in additional calculations : 0.432437 s Total time spent : 0.610256 s Statistics: =========== Parallel Direct Factorization is running on 16 OpenMP < Linear system Ax = b > < transpose > number of equations: 79999 number of non-zeros in A: 100528321 number of non-zeros in A (%): 1.570794 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 72 number of independent subgraphs: 0 number of supernodes: 16760 size of largest supernode: 5224 number of non-zeros in L: 275530542 number of non-zeros in U: 271283135 number of non-zeros in L+U: 546813677 gflop for the numerical factorization: 2112.127917 gflop/s for the numerical factorization: 79.918258 -nan -nan -nan -nan -nan -nan -nan -nan -nan -nan