Major version: 11
Minor version: 2
Update version: 0
Product status:  Beta
Build: n20140312
Processor optimization: Intel(R) Advanced Vector Extensions (Intel(R) AVX) enabled processors
MKLPARDISO<AT>::symbolicFact starts Thu Sep  4 16:25:46 2014


=== PARDISO: solving a symmetric positive definite system ===
The local (internal) PARDISO version is                          : 103911000
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
Matching is turned ON


Summary: ( reordering phase )
================

Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 0.477056 s
Time spent in reordering of the initial matrix (reorder)         : 11.813591 s
Time spent in symbolic factorization (symbfct)                   : 3.329980 s
Time spent in data preparations for factorization (parlist)      : 0.164230 s
Time spent in allocation of internal data structures (malloc)    : 0.613574 s
Time spent in additional calculations                            : 7.429917 s
Total time spent                                                 : 23.828348 s

Statistics:
MKLPARDISO<AT>::numericalFact starts Thu Sep  4 16:26:10 2014

===========
< Parallel Direct Factorization with number of processors: > 8
< Numerical Factorization with BLAS3 and O(n) synchronization >

< Linear system Ax = b >
             number of equations:           1576740
             number of non-zeros in A:      56993250
             number of non-zeros in A (%): 0.002292

             number of right-hand sides:    1

< Factors L and U >
             number of columns for each panel: 192
             number of independent subgraphs:  0
< Preprocessing with state of the art partitioning metis>
             number of supernodes:                    171522
             size of largest supernode:               10602
             number of non-zeros in L:                1336768222
             number of non-zeros in U:                1
             number of non-zeros in L+U:              1336768223
=== 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  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  81  82  84  85  86  87  88  90  92  93  94  95  96  97  98  99  100 
MKLPARDISO<AT>::solve starts Thu Sep  4 16:27:02 2014


=== PARDISO: solving a symmetric positive definite 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)                        : 51.742475 s
Time spent in allocation of internal data structures (malloc)    : 0.000152 s
Time spent in additional calculations                            : 0.000002 s
Total time spent                                                 : 51.742629 s

Statistics:
===========
< Parallel Direct Factorization with number of processors: > 8
< Numerical Factorization with BLAS3 and O(n) synchronization >

< Linear system Ax = b >
             number of equations:           1576740
             number of non-zeros in A:      56993250
             number of non-zeros in A (%): 0.002292

             number of right-hand sides:    1

< Factors L and U >
             number of columns for each panel: 192
             number of independent subgraphs:  0
< Preprocessing with state of the art partitioning metis>
             number of supernodes:                    171522
             size of largest supernode:               10602
             number of non-zeros in L:                1336768222
             number of non-zeros in U:                1
             number of non-zeros in L+U:              1336768223
             gflop   for the numerical factorization: 4695.075325

             gflop/s for the numerical factorization: 90.739288


=== PARDISO: solving a symmetric positive definite system ===


Summary: ( solution phase )
================

Times:
======
Time spent in direct solver at solve step (solve)                : 0.816539 s
Time spent in additional calculations                            : 1.857128 s
MKLPARDISO<AT>::solve ends Thu Sep  4 16:27:05 2014

Total time spent                                                 : 2.673667 s

Statistics:
===========
< Parallel Direct Factorization with number of processors: > 8
< Numerical Factorization with BLAS3 and O(n) synchronization >

< Linear system Ax = b >
             number of equations:           1576740
             number of non-zeros in A:      56993250
             number of non-zeros in A (%): 0.002292

             number of right-hand sides:    1

< Factors L and U >
             number of columns for each panel: 192
             number of independent subgraphs:  0
< Preprocessing with state of the art partitioning metis>
             number of supernodes:                    171522
             size of largest supernode:               10602
             number of non-zeros in L:                1336768222
             number of non-zeros in U:                1
             number of non-zeros in L+U:              1336768223
             gflop   for the numerical factorization: 4695.075325

             gflop/s for the numerical factorization: 90.739288