Intel(R) Math Kernel Library Version 11.3.0 Product Build 20150730 for Intel(R) 64 architecture applications
=== PARDISO is running in In-Core mode, because iparam(60)=0 ===
=== PARDISO: solving a symmetric positive definite system ===
1-based array indexing is turned ON
PARDISO double precision computation is turned ON
METIS algorithm at reorder step is turned ON
Single-level factorization algorithm is turned ON
Summary: ( starting phase is reordering, ending phase is factorization )
================
Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 0.025572 s
Time spent in reordering of the initial matrix (reorder) : 0.049339 s
Time spent in symbolic factorization (symbfct) : 0.036893 s
Time spent in data preparations for factorization (parlist) : 0.000481 s
Time spent in copying matrix to internal data structure (A to LU): 0.000000 s
Time spent in factorization step (numfct) : 0.053888 s
Time spent in allocation of internal data structures (malloc) : 0.003911 s
Time spent in additional calculations : 0.016917 s
Total time spent : 0.187001 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : at critical
1 : solving, num of iteration == 1
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.018624 s
Time spent in additional calculations : 0.010889 s
Total time spent : 0.029513 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 2
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.002055 s
Time spent in additional calculations : 0.023833 s
Total time spent : 0.025888 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 3
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.002025 s
Time spent in additional calculations : 0.006549 s
Total time spent : 0.008574 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 4
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.015964 s
Time spent in additional calculations : 0.001375 s
Total time spent : 0.017339 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 5
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.002013 s
Time spent in additional calculations : 0.001817 s
Total time spent : 0.003830 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 6
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.017996 s
Time spent in additional calculations : 0.001325 s
Total time spent : 0.019321 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 7
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.002021 s
Time spent in additional calculations : 0.001746 s
Total time spent : 0.003767 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 8
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.002147 s
Time spent in additional calculations : 0.001316 s
Total time spent : 0.003463 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 9
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001987 s
Time spent in additional calculations : 0.001613 s
Total time spent : 0.003600 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 10
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001997 s
Time spent in additional calculations : 0.001198 s
Total time spent : 0.003195 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 11
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001969 s
Time spent in additional calculations : 0.001584 s
Total time spent : 0.003553 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 12
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.002019 s
Time spent in additional calculations : 0.001197 s
Total time spent : 0.003216 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 13
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.002008 s
Time spent in additional calculations : 0.001596 s
Total time spent : 0.003604 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 14
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001964 s
Time spent in additional calculations : 0.001199 s
Total time spent : 0.003163 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 15
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001941 s
Time spent in additional calculations : 0.001609 s
Total time spent : 0.003550 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 16
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001986 s
Time spent in additional calculations : 0.001205 s
Total time spent : 0.003191 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 17
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001997 s
Time spent in additional calculations : 0.001615 s
Total time spent : 0.003612 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 18
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001939 s
Time spent in additional calculations : 0.001174 s
Total time spent : 0.003113 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 19
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001967 s
Time spent in additional calculations : 0.001600 s
Total time spent : 0.003567 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
1 : at critical
1 : solving, num of iteration == 20
=== PARDISO: solving a symmetric positive definite system ===
Summary: ( solution phase )
================
Times:
======
Time spent in direct solver at solve step (solve) : 0.001962 s
Time spent in additional calculations : 0.001177 s
Total time spent : 0.003139 s
Statistics:
===========
Parallel Direct Factorization is running on 24 OpenMP
< Linear system Ax = b >
number of equations: 14190
number of non-zeros in A: 167808
number of non-zeros in A (%): 0.083339
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 64
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 3596
size of largest supernode: 370
number of non-zeros in L: 1065670
number of non-zeros in U: 1
number of non-zeros in L+U: 1065671
gflop for the numerical factorization: 0.185019
gflop/s for the numerical factorization: 3.433401
1 : complete
==== PASSED ====