matrix name = inline_1.mtx
503712 x 503712, #nnz == 18660027
=== PARDISO: solving a real nonsymmetric system ===
1-based array indexing is turned ON
PARDISO double precision computation is turned ON
METIS algorithm at reorder step is turned ON
Summary: ( reordering phase )
================
Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 0.361332 s
Time spent in reordering of the initial matrix (reorder) : 2.562928 s
Time spent in symbolic factorization (symbfct) : 0.477838 s
Time spent in data preparations for factorization (parlist) : 0.015024 s
Time spent in allocation of internal data structures (malloc) : 0.028316 s
Time spent in matching/scaling : 0.003866 s
Time spent in additional calculations : 1.115373 s
Total time spent : 4.564677 s
Statistics:
===========
Parallel Direct Factorization is running on 112 OpenMP
< Linear system Ax = b >
number of equations: 503712
number of non-zeros in A: 18660027
number of non-zeros in A (%): 0.007354
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 72
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 66337
size of largest supernode: 1452
number of non-zeros in L: 185341162
number of non-zeros in U: 169610090
number of non-zeros in L+U: 354951252
... Reordering is completed : 4.662905 sec
=== PARDISO is running in In-Core mode, because iparam(60)=0 ===
Percentage of computed non-zeros for LL^T factorization
1 % 2 % 3 % 4 % 5 % 6 % 7 % 8 % 9 % 10 % 11 % 12 % 13 % 14 % 15 % 16 % 17 % 18 % 19 % 20 % 21 % 23 % 24 % 25 % 26 % 27 % 28 % 31 % 34 % 35 % 39 % 42 % 43 % 45 % 46 % 47 % 48 % 53 % 55 % 57 % 63 % 70 % 72 % 78 % 80 % 88 % 97 % 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.000000 s
Time spent in factorization step (numfct) : 0.651211 s
Time spent in allocation of internal data structures (malloc) : 0.000055 s
Time spent in additional calculations : 0.000002 s
Total time spent : 0.651268 s
Statistics:
===========
Parallel Direct Factorization is running on 112 OpenMP
< Linear system Ax = b >
number of equations: 503712
number of non-zeros in A: 18660027
number of non-zeros in A (%): 0.007354
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 72
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 66337
size of largest supernode: 1452
number of non-zeros in L: 185341162
number of non-zeros in U: 169610090
number of non-zeros in L+U: 354951252
gflop for the numerical factorization: 308.602314
gflop/s for the numerical factorization: 473.889881
... Factorization Completed : 0.651360 sec
... Solution stage is completed : 0.039350 sec