igl::opengl::glfw::Viewer usage: [drag] Rotate scene A,a Toggle animation (tight draw loop) F,f Toggle face based I,i Toggle invert normals L,l Toggle wireframe O,o Toggle orthographic/perspective projection T,t Toggle filled faces Z Snap to canonical view [,] Toggle between rotation control types (trackball, two-axis valuator with fixed up, 2D mode with no rotation)) <,> Toggle between models ; Toggle vertex labels : Toggle face labels === 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 % 19 % 20 % 21 % 22 % 24 % 25 % 26 % 27 % 29 % 30 % 32 % 34 % 35 % 37 % 38 % 40 % 42 % 44 % 46 % 47 % 49 % 51 % 52 % 54 % 56 % 68 % 72 % 74 % 75 % 77 % 78 % 79 % 81 % 82 % 83 % 84 % 85 % 86 % 87 % 88 % 89 % 91 % 92 % 93 % 94 % 95 % 99 % 100 % === PARDISO: solving a symmetric positive definite system === 0-based array is turned ON PARDISO double precision computation is turned ON METIS algorithm at reorder step is turned ON Single-level factorization algorithm is turned ON Summary: ( starting phase is reordering, ending phase is factorization ) ================ Times: ====== Time spent in calculations of symmetric matrix portrait (fulladj): 0.004380 s Time spent in reordering of the initial matrix (reorder) : 0.386061 s Time spent in symbolic factorization (symbfct) : 0.036806 s Time spent in data preparations for factorization (parlist) : 0.004285 s Time spent in copying matrix to internal data structure (A to LU): 0.000000 s Time spent in factorization step (numfct) : 0.034286 s Time spent in allocation of internal data structures (malloc) : 0.012835 s Time spent in additional calculations : 0.033566 s Total time spent : 0.512220 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 1 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.032346 s Time spent in additional calculations : 0.077155 s Total time spent : 0.109501 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.032736 s Time spent in additional calculations : 0.078826 s Total time spent : 0.111562 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.034577 s Time spent in additional calculations : 0.093013 s Total time spent : 0.127590 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.032372 s Time spent in additional calculations : 0.078980 s Total time spent : 0.111351 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.035148 s Time spent in additional calculations : 0.085351 s Total time spent : 0.120499 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.048092 s Time spent in additional calculations : 0.083026 s Total time spent : 0.131118 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037045 s Time spent in additional calculations : 0.078003 s Total time spent : 0.115049 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.032181 s Time spent in additional calculations : 0.078015 s Total time spent : 0.110196 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.042860 s Time spent in additional calculations : 0.084124 s Total time spent : 0.126984 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.032029 s Time spent in additional calculations : 0.072522 s Total time spent : 0.104551 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.051250 s Time spent in additional calculations : 0.089339 s Total time spent : 0.140588 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.044329 s Time spent in additional calculations : 0.087486 s Total time spent : 0.131815 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.046739 s Time spent in additional calculations : 0.094146 s Total time spent : 0.140885 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.033733 s Time spent in additional calculations : 0.072566 s Total time spent : 0.106299 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.033389 s Time spent in additional calculations : 0.088900 s Total time spent : 0.122289 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.036610 s Time spent in additional calculations : 0.083725 s Total time spent : 0.120335 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.040392 s Time spent in additional calculations : 0.081704 s Total time spent : 0.122096 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.042018 s Time spent in additional calculations : 0.096335 s Total time spent : 0.138353 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.041005 s Time spent in additional calculations : 0.085495 s Total time spent : 0.126500 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.030886 s Time spent in additional calculations : 0.085388 s Total time spent : 0.116274 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.035194 s Time spent in additional calculations : 0.078233 s Total time spent : 0.113427 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.038207 s Time spent in additional calculations : 0.082125 s Total time spent : 0.120332 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.033893 s Time spent in additional calculations : 0.078954 s Total time spent : 0.112848 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.040677 s Time spent in additional calculations : 0.101124 s Total time spent : 0.141801 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.048256 s Time spent in additional calculations : 0.076441 s Total time spent : 0.124697 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.038731 s Time spent in additional calculations : 0.074661 s Total time spent : 0.113392 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.035026 s Time spent in additional calculations : 0.082571 s Total time spent : 0.117598 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.047275 s Time spent in additional calculations : 0.082692 s Total time spent : 0.129967 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.034973 s Time spent in additional calculations : 0.087246 s Total time spent : 0.122219 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.041099 s Time spent in additional calculations : 0.085450 s Total time spent : 0.126550 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.058106 s Time spent in additional calculations : 0.078406 s Total time spent : 0.136512 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.064654 s Time spent in additional calculations : 0.141994 s Total time spent : 0.206648 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.061687 s Time spent in additional calculations : 0.076853 s Total time spent : 0.138540 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.044083 s Time spent in additional calculations : 0.088703 s Total time spent : 0.132785 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.038724 s Time spent in additional calculations : 0.079007 s Total time spent : 0.117730 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.051615 s Time spent in additional calculations : 0.090526 s Total time spent : 0.142141 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.050651 s Time spent in additional calculations : 0.077860 s Total time spent : 0.128512 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.034436 s Time spent in additional calculations : 0.083909 s Total time spent : 0.118345 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037969 s Time spent in additional calculations : 0.076534 s Total time spent : 0.114503 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.055558 s Time spent in additional calculations : 0.105383 s Total time spent : 0.160941 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.035278 s Time spent in additional calculations : 0.081650 s Total time spent : 0.116929 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.065191 s Time spent in additional calculations : 0.089110 s Total time spent : 0.154301 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.045002 s Time spent in additional calculations : 0.084203 s Total time spent : 0.129205 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037855 s Time spent in additional calculations : 0.083126 s Total time spent : 0.120981 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.038773 s Time spent in additional calculations : 0.117982 s Total time spent : 0.156755 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037590 s Time spent in additional calculations : 0.082800 s Total time spent : 0.120390 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037581 s Time spent in additional calculations : 0.107823 s Total time spent : 0.145405 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.036600 s Time spent in additional calculations : 0.112704 s Total time spent : 0.149304 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.051868 s Time spent in additional calculations : 0.140064 s Total time spent : 0.191932 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.032970 s Time spent in additional calculations : 0.082666 s Total time spent : 0.115636 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.040503 s Time spent in additional calculations : 0.079475 s Total time spent : 0.119978 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037921 s Time spent in additional calculations : 0.107201 s Total time spent : 0.145122 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.036856 s Time spent in additional calculations : 0.087929 s Total time spent : 0.124785 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.033677 s Time spent in additional calculations : 0.095722 s Total time spent : 0.129399 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.062657 s Time spent in additional calculations : 0.087408 s Total time spent : 0.150065 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.046266 s Time spent in additional calculations : 0.088672 s Total time spent : 0.134938 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.053029 s Time spent in additional calculations : 0.107488 s Total time spent : 0.160517 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.039941 s Time spent in additional calculations : 0.084989 s Total time spent : 0.124930 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.042952 s Time spent in additional calculations : 0.077014 s Total time spent : 0.119966 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.048948 s Time spent in additional calculations : 0.075803 s Total time spent : 0.124751 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037240 s Time spent in additional calculations : 0.087778 s Total time spent : 0.125018 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.034529 s Time spent in additional calculations : 0.085071 s Total time spent : 0.119600 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.051051 s Time spent in additional calculations : 0.094081 s Total time spent : 0.145132 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.046517 s Time spent in additional calculations : 0.082579 s Total time spent : 0.129096 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037733 s Time spent in additional calculations : 0.102019 s Total time spent : 0.139753 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.041285 s Time spent in additional calculations : 0.099841 s Total time spent : 0.141126 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.039972 s Time spent in additional calculations : 0.100323 s Total time spent : 0.140294 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.041762 s Time spent in additional calculations : 0.086776 s Total time spent : 0.128537 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.034772 s Time spent in additional calculations : 0.084407 s Total time spent : 0.119179 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.054190 s Time spent in additional calculations : 0.093645 s Total time spent : 0.147835 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.051746 s Time spent in additional calculations : 0.089261 s Total time spent : 0.141007 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.058208 s Time spent in additional calculations : 0.115196 s Total time spent : 0.173404 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.040613 s Time spent in additional calculations : 0.082626 s Total time spent : 0.123239 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.049307 s Time spent in additional calculations : 0.101912 s Total time spent : 0.151218 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.040464 s Time spent in additional calculations : 0.079261 s Total time spent : 0.119725 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.043786 s Time spent in additional calculations : 0.087377 s Total time spent : 0.131163 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.042670 s Time spent in additional calculations : 0.080289 s Total time spent : 0.122958 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.039872 s Time spent in additional calculations : 0.081303 s Total time spent : 0.121174 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.056376 s Time spent in additional calculations : 0.091066 s Total time spent : 0.147443 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.037414 s Time spent in additional calculations : 0.086930 s Total time spent : 0.124343 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.039003 s Time spent in additional calculations : 0.116473 s Total time spent : 0.155476 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.039976 s Time spent in additional calculations : 0.077520 s Total time spent : 0.117495 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.052168 s Time spent in additional calculations : 0.077976 s Total time spent : 0.130144 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.058638 s Time spent in additional calculations : 0.147367 s Total time spent : 0.206005 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.051138 s Time spent in additional calculations : 0.077946 s Total time spent : 0.129084 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.044520 s Time spent in additional calculations : 0.082781 s Total time spent : 0.127302 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.062659 s Time spent in additional calculations : 0.148265 s Total time spent : 0.210924 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.039525 s Time spent in additional calculations : 0.081645 s Total time spent : 0.121170 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 4 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617 === PARDISO: solving a symmetric positive definite system === Summary: ( solution phase ) ================ Times: ====== Time spent in direct solver at solve step (solve) : 0.034477 s Time spent in additional calculations : 0.075673 s Total time spent : 0.110150 s Statistics: =========== Parallel Direct Factorization is running on 6 OpenMP < Linear system Ax = b > number of equations: 88869 number of non-zeros in A: 548001 number of non-zeros in A (%): 0.006939 number of right-hand sides: 2 < Factors L and U > number of columns for each panel: 64 number of independent subgraphs: 0 < Preprocessing with state of the art partitioning metis> number of supernodes: 53577 size of largest supernode: 201 number of non-zeros in L: 3846137 number of non-zeros in U: 1 number of non-zeros in L+U: 3846138 gflop for the numerical factorization: 0.414677 gflop/s for the numerical factorization: 12.094617