=== PARDISO: solving a symmetric indefinite system ===
The local (internal) PARDISO version is : 103900117
1-based array indexing is turned ON
PARDISO double precision computation is turned ON
Minimum degree algorithm at reorder step is turned ON
Scaling is turned ON
Summary: ( reordering phase )
================
Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 0.000007 s
Time spent in reordering of the initial matrix (reorder) : 0.000006 s
Time spent in symbolic factorization (symbfct) : 0.000269 s
Time spent in data preparations for factorization (parlist) : 0.000002 s
Time spent in allocation of internal data structures (malloc) : 0.004475 s
Time spent in additional calculations : 0.000015 s
Total time spent : 0.004773 s
Statistics:
===========
< Parallel Direct Factorization with number of processors: > 2
< Numerical Factorization with BLAS3 and O(n) synchronization >
< Linear system Ax = b >
number of equations: 2
number of non-zeros in A: 3
number of non-zeros in A (): 75.000000
number of right-hand sides: 1
< Factors L and U >
< Preprocessing with multiple minimum degree, tree height >
< Reduction for efficient parallel factorization >
number of columns for each panel: 128
number of independent subgraphs: 0
number of supernodes: 1
size of largest supernode: 2
number of non-zeros in L: 4
number of non-zeros in U: 1
number of non-zeros in L+U: 5
Reordering completed ...
Number of nonzeros in factors = 5
Number of factorization MFLOPS = 0