matrix = 1 matrix loaded, N=2727, nnz = 2727, nnz per row = 1.000000e+00 time of converter = 4.075573e-02 === 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 % 6 % 7 % 8 % 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 % 80 % 81 % 82 % 83 % 84 % 85 % 86 % 87 % 88 % 89 % 90 % 91 % 92 % 93 % 94 % 95 % 96 % 97 % 98 % 99 % 100 % === PARDISO: solving a real nonsymmetric system === 0-based array is turned ON PARDISO double precision computation is turned ON Minimum degree algorithm at reorder step is turned ON Scaling is turned ON Matching is turned ON Single-level factorization algorithm is turned ON Summary: ( starting phase is reordering, ending phase is solution ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait (fulladj): 0.000147 s Time spent in reordering of the initial matrix (reorder) : 0.000130 s Time spent in symbolic factorization (symbfct) : 0.004704 s Time spent in data preparations for factorization (parlist) : 0.000037 s Time spent in copying matrix to internal data structure (A to LU): 0.000000 s Time spent in factorization step (numfct) : 0.016585 s Time spent in direct solver at solve step (solve) : 0.007162 s Time spent in allocation of internal data structures (malloc) : 0.000405 s Time spent in additional calculations : 0.006728 s Total time spent : 0.035898 s Statistics: =========== Parallel Direct Factorization is running on 1 OpenMP < Linear system Ax = b > number of equations: 2727 number of non-zeros in A: 2727 number of non-zeros in A (%): 0.036670 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: 2727 size of largest supernode: 1 number of non-zeros in L: 2727 number of non-zeros in U: 1 number of non-zeros in L+U: 2728 gflop for the numerical factorization: 0.000000 gflop/s for the numerical factorization: 0.000000 matrix = 2 matrix loaded, N=81, nnz = 81, nnz per row = 1.000000e+00 time of converter = 1.246110e-05 === PARDISO is running in In-Core mode, because iparam(60)=0 === Percentage of computed non-zeros for LL^T factorization 1 % 2 % 3 % 4 % 6 % 7 % 8 % 9 % 11 % 12 % 13 % 14 % 16 % 17 % 18 % 19 % 20 % 22 % 23 % 24 % 25 % 27 % 28 % 29 % 30 % 32 % 33 % 34 % 35 % 37 % 38 % 39 % 40 % 41 % 43 % 44 % 45 % 46 % 48 % 49 % 50 % 51 % 53 % 54 % 55 % 56 % 58 % 59 % 60 % 61 % 62 % 64 % 65 % 66 % 67 % 69 % 70 % 71 % 72 % 74 % 75 % 76 % 77 % 79 % 80 % 81 % 82 % 83 % 85 % 86 % 87 % 88 % 90 % 91 % 92 % 93 % 95 % 96 % 97 % 98 % 100 % === PARDISO: solving a real nonsymmetric system === 0-based array is turned ON PARDISO double precision computation is turned ON Minimum degree algorithm at reorder step is turned ON Scaling is turned ON Matching is turned ON Single-level factorization algorithm is turned ON Summary: ( starting phase is reordering, ending phase is solution ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait (fulladj): 0.000003 s Time spent in reordering of the initial matrix (reorder) : 0.000052 s Time spent in symbolic factorization (symbfct) : 0.000023 s Time spent in data preparations for factorization (parlist) : 0.000001 s Time spent in copying matrix to internal data structure (A to LU): 0.000000 s Time spent in factorization step (numfct) : 0.000135 s Time spent in direct solver at solve step (solve) : 0.000006 s Time spent in allocation of internal data structures (malloc) : 0.000037 s Time spent in additional calculations : 0.000009 s Total time spent : 0.000266 s Statistics: =========== Parallel Direct Factorization is running on 1 OpenMP < Linear system Ax = b > number of equations: 81 number of non-zeros in A: 81 number of non-zeros in A (%): 1.234568 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: 81 size of largest supernode: 1 number of non-zeros in L: 81 number of non-zeros in U: 1 number of non-zeros in L+U: 82 gflop for the numerical factorization: 0.000000 gflop/s for the numerical factorization: 0.000000 matrix = 3 matrix loaded, N=231360, nnz = 5144569, nnz per row = 2.223621e+01 time of converter = 2.318129e-01 === 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 % 6 % 7 % 8 % 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 % 80 % 81 % 82 % 83 % 84 % 85 % 86 % 87 % 88 % 89 % 90 % 91 % 92 % 93 % 94 % 95 % 96 % 97 % 98 % 99 % 100 % === PARDISO: solving a real nonsymmetric system === 0-based array is turned ON PARDISO double precision computation is turned ON Minimum degree algorithm at reorder step is turned ON Scaling is turned ON Matching is turned ON Single-level factorization algorithm is turned ON Summary: ( starting phase is reordering, ending phase is solution ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait (fulladj): 0.103915 s Time spent in reordering of the initial matrix (reorder) : 0.118940 s Time spent in symbolic factorization (symbfct) : 0.267312 s Time spent in data preparations for factorization (parlist) : 0.007046 s Time spent in copying matrix to internal data structure (A to LU): 0.000000 s Time spent in factorization step (numfct) : 1.846650 s Time spent in direct solver at solve step (solve) : 0.098187 s Time spent in allocation of internal data structures (malloc) : 0.281428 s Time spent in additional calculations : 0.351382 s Total time spent : 3.074860 s Statistics: =========== Parallel Direct Factorization is running on 1 OpenMP < Linear system Ax = b > number of equations: 231360 number of non-zeros in A: 5144569 number of non-zeros in A (%): 0.009611 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: 60180 size of largest supernode: 796 number of non-zeros in L: 32264772 number of non-zeros in U: 26908380 number of non-zeros in L+U: 59173152 gflop for the numerical factorization: 18.790268 gflop/s for the numerical factorization: 10.175328 matrix = 4 matrix loaded, N=81, nnz = 81, nnz per row = 1.000000e+00 time of converter = 1.404714e-05 === PARDISO is running in In-Core mode, because iparam(60)=0 === Percentage of computed non-zeros for LL^T factorization 1 % 2 % 3 % 4 % 6 % 7 % 8 % 9 % 11 % 12 % 13 % 14 % 16 % 17 % 18 % 19 % 20 % 22 % 23 % 24 % 25 % 27 % 28 % 29 % 30 % 32 % 33 % 34 % 35 % 37 % 38 % 39 % 40 % 41 % 43 % 44 % 45 % 46 % 48 % 49 % 50 % 51 % 53 % 54 % 55 % 56 % 58 % 59 % 60 % 61 % 62 % 64 % 65 % 66 % 67 % 69 % 70 % 71 % 72 % 74 % 75 % 76 % 77 % 79 % 80 % 81 % 82 % 83 % 85 % 86 % 87 % 88 % 90 % 91 % 92 % 93 % 95 % 96 % 97 % 98 % 100 % === PARDISO: solving a real nonsymmetric system === 0-based array is turned ON PARDISO double precision computation is turned ON Minimum degree algorithm at reorder step is turned ON Scaling is turned ON Matching is turned ON Single-level factorization algorithm is turned ON Summary: ( starting phase is reordering, ending phase is solution ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait (fulladj): 0.000003 s Time spent in reordering of the initial matrix (reorder) : 0.000008 s Time spent in symbolic factorization (symbfct) : 0.000027 s Time spent in data preparations for factorization (parlist) : 0.000001 s Time spent in copying matrix to internal data structure (A to LU): 0.000000 s Time spent in factorization step (numfct) : 0.000142 s Time spent in direct solver at solve step (solve) : 0.000008 s Time spent in allocation of internal data structures (malloc) : 0.000042 s Time spent in additional calculations : 0.000022 s Total time spent : 0.000253 s Statistics: =========== Parallel Direct Factorization is running on 1 OpenMP < Linear system Ax = b > number of equations: 81 number of non-zeros in A: 81 number of non-zeros in A (%): 1.234568 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: 81 size of largest supernode: 1 number of non-zeros in L: 81 number of non-zeros in U: 1 number of non-zeros in L+U: 82 gflop for the numerical factorization: 0.000000 gflop/s for the numerical factorization: 0.000000 matrix = 5 matrix loaded, N=58320, nnz = 520078, nnz per row = 8.917661e+00 time of converter = 7.616325e-03 === 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 % 6 % 7 % 8 % 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 % 80 % 81 % 82 % 83 % 84 % 85 % 86 % 87 % 89 % 90 % 91 % 92 % 93 % 95 % 96 % 97 % 98 % 99 % 100 % === PARDISO: solving a real nonsymmetric system === 0-based array is turned ON PARDISO double precision computation is turned ON Minimum degree algorithm at reorder step is turned ON Scaling is turned ON Matching is turned ON Single-level factorization algorithm is turned ON Summary: ( starting phase is reordering, ending phase is solution ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait (fulladj): 0.006321 s Time spent in reordering of the initial matrix (reorder) : 0.032088 s Time spent in symbolic factorization (symbfct) : 0.037123 s Time spent in data preparations for factorization (parlist) : 0.001628 s Time spent in copying matrix to internal data structure (A to LU): 0.000000 s Time spent in factorization step (numfct) : 0.204689 s Time spent in direct solver at solve step (solve) : 0.013690 s Time spent in allocation of internal data structures (malloc) : 0.415014 s Time spent in additional calculations : 0.028052 s Total time spent : 0.738605 s Statistics: =========== Parallel Direct Factorization is running on 1 OpenMP < Linear system Ax = b > number of equations: 58320 number of non-zeros in A: 520078 number of non-zeros in A (%): 0.015291 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: 27784 size of largest supernode: 429 number of non-zeros in L: 4515853 number of non-zeros in U: 3620319 number of non-zeros in L+U: 8136172 gflop for the numerical factorization: 1.362527 gflop/s for the numerical factorization: 6.656571