| 1 | + | [Initialization : 93.5711ms] |
| 2 | + | |
| 3 | + | === PARDISO: solving a symmetric positive definite system === |
| 4 | + | Matrix checker is turned ON |
| 5 | + | 0-based array is turned ON |
| 6 | + | PARDISO single precision computation is turned ON |
| 7 | + | Parallel METIS algorithm at reorder step is turned ON |
| 8 | + | Scaling is turned ON |
| 9 | + | |
| 10 | + | |
| 11 | + | Summary: ( reordering phase ) |
| 12 | + | ================ |
| 13 | + | |
| 14 | + | Times: |
| 15 | + | ====== |
| 16 | + | Time spent in calculations of symmetric matrix portrait (fulladj): 0.007159 s |
| 17 | + | Time spent in reordering of the initial matrix (reorder) : 0.192191 s |
| 18 | + | Time spent in symbolic factorization (symbfct) : 0.124976 s |
| 19 | + | Time spent in data preparations for factorization (parlist) : 0.017136 s |
| 20 | + | Time spent in allocation of internal data structures (malloc) : 0.041448 s |
| 21 | + | Time spent in additional calculations : 0.032469 s |
| 22 | + | Total time spent : 0.415379 s |
| 23 | + | |
| 24 | + | Statistics: |
| 25 | + | =========== |
| 26 | + | Parallel Direct Factorization is running on 8 OpenMP |
| 27 | + | |
| 28 | + | < Linear system Ax = b > |
| 29 | + | number of equations: 262144 |
| 30 | + | number of non-zeros in A: 965596 |
| 31 | + | number of non-zeros in A (%): 0.001405 |
| 32 | + | |
| 33 | + | number of right-hand sides: 1 |
| 34 | + | |
| 35 | + | < Factors L and U > |
| 36 | + | number of columns for each panel: 48 |
| 37 | + | number of independent subgraphs: 0 |
| 38 | + | number of supernodes: 181608 |
| 39 | + | size of largest supernode: 5270 |
| 40 | + | number of non-zeros in L: 92983874 |
| 41 | + | number of non-zeros in U: 1 |
| 42 | + | number of non-zeros in L+U: 92983875 |
| 43 | + | Reordering completed ... |
| 44 | + | Number of nonzeros in factors = 92983875 |
| 45 | + | Number of factorization MFLOPS = 241855 |
| 46 | + | === PARDISO is running in In-Core mode, because iparam(60)=0 === |
| 47 | + | |
| 48 | + | Percentage of computed non-zeros for LL^T factorization |
| 49 | + | 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 % 50 % 51 % 52 % 53 % 54 % 55 % 56 % 57 % 58 % 60 % 61 % 63 % 64 % 66 % 68 % 70 % 71 % 72 % 74 % 76 % 78 % 81 % 82 % 84 % 86 % 87 % 89 % 91 % 92 % 94 % 95 % 96 % 97 % 98 % 99 % 100 % |
| 50 | + | |
| 51 | + | === PARDISO: solving a symmetric positive definite system === |
| 52 | + | Two-level factorization algorithm is turned ON |
| 53 | + | |
| 54 | + | |
| 55 | + | Summary: ( factorization phase ) |
| 56 | + | ================ |
| 57 | + | |
| 58 | + | Times: |
| 59 | + | ====== |
| 60 | + | Time spent in copying matrix to internal data structure (A to LU): 0.000001 s |
| 61 | + | Time spent in factorization step (numfct) : 1.458724 s |
| 62 | + | Time spent in allocation of internal data structures (malloc) : 0.001355 s |
| 63 | + | Time spent in additional calculations : 0.000003 s |
| 64 | + | Total time spent : 1.460083 s |
| 65 | + | |
| 66 | + | Statistics: |
| 67 | + | =========== |
| 68 | + | Parallel Direct Factorization is running on 8 OpenMP |
| 69 | + | |
| 70 | + | < Linear system Ax = b > |
| 71 | + | number of equations: 262144 |
| 72 | + | number of non-zeros in A: 965596 |
| 73 | + | number of non-zeros in A (%): 0.001405 |
| 74 | + | |
| 75 | + | number of right-hand sides: 1 |
| 76 | + | |
| 77 | + | < Factors L and U > |
| 78 | + | number of columns for each panel: 48 |
| 79 | + | number of independent subgraphs: 0 |
| 80 | + | number of supernodes: 181608 |
| 81 | + | size of largest supernode: 5270 |
| 82 | + | number of non-zeros in L: 92983874 |
| 83 | + | number of non-zeros in U: 1 |
| 84 | + | number of non-zeros in L+U: 92983875 |
| 85 | + | gflop for the numerical factorization: 241.855850 |
| 86 | + | |
| 87 | + | gflop/s for the numerical factorization: 165.799622 |
| 88 | + | |
| 89 | + | Factorization completed ... |
| 90 | + | |
| 91 | + | === PARDISO: solving a symmetric positive definite system === |
| 92 | + | |
| 93 | + | |
| 94 | + | Summary: ( solution phase ) |
| 95 | + | ================ |
| 96 | + | |
| 97 | + | Times: |
| 98 | + | ====== |
| 99 | + | Time spent in direct solver at solve step (solve) : 0.021083 s |
| 100 | + | Time spent in additional calculations : 0.001327 s |
| 101 | + | Total time spent : 0.022410 s |
| 102 | + | |
| 103 | + | Statistics: |
| 104 | + | =========== |
| 105 | + | Parallel Direct Factorization is running on 8 OpenMP |
| 106 | + | |
| 107 | + | < Linear system Ax = b > |
| 108 | + | number of equations: 262144 |
| 109 | + | number of non-zeros in A: 965596 |
| 110 | + | number of non-zeros in A (%): 0.001405 |
| 111 | + | |
| 112 | + | number of right-hand sides: 1 |
| 113 | + | |
| 114 | + | < Factors L and U > |
| 115 | + | number of columns for each panel: 48 |
| 116 | + | number of independent subgraphs: 0 |
| 117 | + | number of supernodes: 181608 |
| 118 | + | size of largest supernode: 5270 |
| 119 | + | number of non-zeros in L: 92983874 |
| 120 | + | number of non-zeros in U: 1 |
| 121 | + | number of non-zeros in L+U: 92983875 |
| 122 | + | gflop for the numerical factorization: 241.855850 |
| 123 | + | |
| 124 | + | gflop/s for the numerical factorization: 165.799622 |
| 125 | + | |
| 126 | + | Solve completed ... |
| 127 | + | |