=== 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
Summary: ( reordering phase )
================
Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 0.000196 s
Time spent in reordering of the initial matrix (reorder) : 0.021893 s
Time spent in symbolic factorization (symbfct) : 0.001461 s
Time spent in data preparations for factorization (parlist) : 0.000075 s
Time spent in allocation of internal data structures (malloc) : 0.002632 s
Time spent in additional calculations : 0.001624 s
Total time spent : 0.027881 s
Statistics:
===========
Parallel Direct Factorization is running on 1 OpenMP
< Linear system Ax = b >
number of equations: 3428
number of non-zeros in A: 54892
number of non-zeros in A (%): 0.467119
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 80
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 2473
size of largest supernode: 123
number of non-zeros in L: 150117
number of non-zeros in U: 1
number of non-zeros in L+U: 150118
=== 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 %
8 %
9 %
10 %
11 %
12 %
13 %
14 %
15 %
16 %
19 %
22 %
23 %
24 %
25 %
26 %
27 %
28 %
30 %
31 %
32 %
33 %
34 %
35 %
36 %
37 %
38 %
39 %
43 %
50 %
51 %
52 %
53 %
54 %
55 %
60 %
61 %
62 %
63 %
64 %
65 %
66 %
67 %
69 %
72 %
73 %
74 %
75 %
76 %
77 %
78 %
81 %
82 %
83 %
84 %
85 %
86 %
87 %
88 %
89 %
90 %
92 %
98 %
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) : 0.022777 s
Time spent in allocation of internal data structures (malloc) : 0.000880 s
Time spent in additional calculations : 0.000002 s
Total time spent : 0.023659 s
Statistics:
===========
Parallel Direct Factorization is running on 1 OpenMP
< Linear system Ax = b >
number of equations: 3428
number of non-zeros in A: 54892
number of non-zeros in A (%): 0.467119
number of right-hand sides: 1
< Factors L and U >
number of columns for each panel: 80
number of independent subgraphs: 0
< Preprocessing with state of the art partitioning metis>
number of supernodes: 2473
size of largest supernode: 123
number of non-zeros in L: 150117
number of non-zeros in U: 1
number of non-zeros in L+U: 150118
gflop for the numerical factorization: 0.012677
gflop/s for the numerical factorization: 0.556580
Number of negative eigenvalues according to Pardiso is 1309.
Eigenvalues computed by Eigen (dense):
[-203.012,..., -8.81333e-08, 1,..., 204.012]
number of negative eigenvalues is 1306