=== PARDISO: solving a symmetric indefinite system ===
1-based array indexing is turned ON
PARDISO double precision computation is turned ON
METIS algorithm at reorder step is turned ON
Scaling is turned ON
Summary: ( reordering phase )
================
Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 1.520856 s
Time spent in reordering of the initial matrix (reorder) : 122.715307 s
Time spent in symbolic factorization (symbfct) : 11.230308 s
Time spent in data preparations for factorization (parlist) : 1.475745 s
Time spent in allocation of internal data structures (malloc) : 4.631759 s
Time spent in additional calculations : 6.145559 s
Total time spent : 147.719534 s
Statistics:
===========
Parallel Direct Factorization is running on 4 OpenMP
< Linear system Ax = b >
number of equations: 100000000
number of non-zeros in A: 199999999
number of non-zeros in A (%): 0.000002
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 112
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 99999990
size of largest supernode: 2
number of non-zeros in L: 299999962
number of non-zeros in U: 1
number of non-zeros in L+U: 299999963
Reordering completed ...
Number of nonzeros in factors = 299999963
Number of factorization MFLOPS = 799=== 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 % 22 % 23 % 24 % 25 % 26 % 27 % 28 % 29 % 30 % 31 % 32 % 33 % 34 % 35 % 36 % 37 % 38 % 39 % 40 % 41 % 42 % 43 % 44 % 45 % 46 % 47 % 48 % 49 % 50 % 51 % 52 % 53 % 54 % 55 % 56 % 57 % 58 % 59 % 60 % 61 % 62 % 63 % 64 % 65 % 66 % 67 % 68 % 69 % 70 % 71 % 72 % 73 % 74 % 75 % 76 % 77 % 78 % 79 % 80 % 81 % 82 % 83 % 84 % 85 % 86 % 87 % 88 % 89 % 90 % 91 % 92 % 93 % 94 % 95 % 96 % 97 % 98 % 99 % 100 %
=== PARDISO: solving a symmetric indefinite 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) : 41.347765 s
Time spent in allocation of internal data structures (malloc) : 0.000405 s
Time spent in additional calculations : 0.000000 s
Total time spent : 41.348170 s
Statistics:
===========
Parallel Direct Factorization is running on 4 OpenMP
< Linear system Ax = b >
number of equations: 100000000
number of non-zeros in A: 199999999
number of non-zeros in A (%): 0.000002
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 112
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 99999990
size of largest supernode: 2
number of non-zeros in L: 299999962
number of non-zeros in U: 1
number of non-zeros in L+U: 299999963
gflop for the numerical factorization: 0.800000
gflop/s for the numerical factorization: 0.019348
Factorization completed ...
=== PARDISO: solving a symmetric indefinite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 17.117727 s
Time spent in additional calculations : 35.971285 s
Total time spent : 53.089012 s
Statistics:
===========
Parallel Direct Factorization is running on 4 OpenMP
< Linear system Ax = b >
number of equations: 100000000
number of non-zeros in A: 199999999
number of non-zeros in A (%): 0.000002
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 112
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 99999990
size of largest supernode: 2
number of non-zeros in L: 299999962
number of non-zeros in U: 1
number of non-zeros in L+U: 299999963
gflop for the numerical factorization: 0.800000
gflop/s for the numerical factorization: 0.019348
Solve completed ...
The solution of the system is: