=== CPARDISO: solving a real nonsymmetric system === 1-based array indexing is turned ON CPARDISO 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.000009 s Time spent in reordering of the initial matrix (reorder) : 0.005978 s Time spent in symbolic factorization (symbfct) : 0.000192 s Time spent in data preparations for factorization (parlist) : 0.000005 s Time spent in allocation of internal data structures (malloc) : 0.016090 s Time spent in additional calculations : 0.000034 s Total time spent : 0.022308 s Statistics: =========== Parallel Direct Factorization is running on 3 MPI and 2 OpenMP per MPI process < Linear system Ax = b > number of equations: 5 number of non-zeros in A: 13 number of non-zeros in A (%): 52.000000 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 96 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 2 size of largest supernode: 4 number of non-zeros in L: 19 number of non-zeros in U: 2 number of non-zeros in L+U: 21 Reordering completed ... Percentage of computed non-zeros for LL^T factorization 94 % 100 % === CPARDISO: solving a real nonsymmetric 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.000013 s Time spent in factorization step (numfct) : 0.608797 s Time spent in allocation of internal data structures (malloc) : 0.000042 s Time spent in additional calculations : 0.000001 s Total time spent : 0.608853 s Statistics: =========== Parallel Direct Factorization is running on 3 MPI and 2 OpenMP per MPI process < Linear system Ax = b > number of equations: 5 number of non-zeros in A: 13 number of non-zeros in A (%): 52.000000 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 96 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 2 size of largest supernode: 4 number of non-zeros in L: 19 number of non-zeros in U: 2 number of non-zeros in L+U: 21 gflop for the numerical factorization: 0.000000 gflop/s for the numerical factorization: 0.000000 Factorization completed ... Solving system... === CPARDISO: solving a real nonsymmetric system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.271727 s Time spent in additional calculations : 0.727953 s Total time spent : 0.999680 s Statistics: =========== Parallel Direct Factorization is running on 3 MPI and 2 OpenMP per MPI process < Linear system Ax = b > number of equations: 5 number of non-zeros in A: 13 number of non-zeros in A (%): 52.000000 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 96 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 2 size of largest supernode: 4 number of non-zeros in L: 19 number of non-zeros in U: 2 number of non-zeros in L+U: 21 gflop for the numerical factorization: 0.000000 gflop/s for the numerical factorization: 0.000000 The solution of the system is: x [0] = -0.522321 x [1] = -0.008929 x [2] = 1.220982 x [3] = -0.504464 x [4] = -0.214286 Relative residual = 2.275280e-16 TEST PASSED