1 0 SNES Function norm 18.865 2 1 SNES Function norm 8.73683e-07 3 2 SNES Function norm < 1.e-11 4L_2 Error: < 1.0e-11 5Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 2 6SNES Object: 7 MPI processes 7 type: newtonls 8 maximum iterations=20, maximum function evaluations=10000 9 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 10 total number of linear solver iterations=13 11 total number of function evaluations=3 12 norm schedule ALWAYS 13 SNESLineSearch Object: 7 MPI processes 14 type: basic 15 maxstep=1.000000e+08, minlambda=1.000000e-12 16 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 17 maximum iterations=40 18 KSP Object: 7 MPI processes 19 type: cg 20 maximum iterations=10000, initial guess is zero 21 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 22 left preconditioning 23 using PRECONDITIONED norm type for convergence test 24 PC Object: 7 MPI processes 25 type: bddc 26 Use verbose output: 0 27 Use user-defined CSR: 0 28 Use local mat graph: 1 29 Connectivity graph topological dimension: 2 30 Use vertices: 1 (vertex size 1) 31 Use edges: 1 32 Use faces: 0 33 Use true near null space: 0 34 Use QR for single constraints on cc: 0 35 Use change of basis on local edge nodes: 0 36 Use change of basis on local face nodes: 0 37 User defined change of basis matrix: 0 38 Has change of basis matrix: 0 39 Eliminate dirichlet boundary dofs: 0 40 Switch on static condensation ops around the interface preconditioner: 0 41 Use exact dirichlet trick: 1 42 Interface extension: DIRICHLET 43 Multilevel max levels: 0 44 Multilevel coarsening ratio: 8 45 Use estimated eigs for coarse problem: 0 46 Use deluxe scaling: 0 47 Use deluxe zerorows: 0 48 Use deluxe singlemat: 0 49 Rebuild interface graph for Schur principal minors: 0 50 Number of dofs' layers for the computation of principal minors: -1 51 Use user CSR graph to compute successive layers: 0 52 Adaptive constraint selection threshold (active 0, userdefined 0): 0. 53 Min constraints / connected component: 0 54 Max constraints / connected component: 0 55 Invert exact Schur complement for adaptive selection: 0 56 Symmetric computation of primal basis functions: 1 57 Num. Procs. to map coarse adjacency list: 0 58 Coarse eqs per proc (significant at the coarsest level): 1 59 Detect disconnected: 0 (filter 0) 60 Benign subspace trick: 0 (change explicit 0) 61 Benign subspace trick is active: 0 62 Algebraic computation of no-net-flux: 0 63 ********************************** STATISTICS AT LEVEL 0 ********************************** 64 Global dofs sizes: all 1485 interface 171 coarse 21 65 Coarsening ratios: all/coarse 70 interface/coarse 8 66 Active processes : 7 67 Total subdomains : 7 68 Dofs type : MIN MAX MEAN 69 Interior dofs : 182 195 187 70 Interface dofs : 29 66 50 71 Primal dofs : 3 10 7 72 Local dofs : 216 254 237 73 Local subs : 1 1 74 --- Interior solver (rank 0) 75 KSP Object: (pc_bddc_dirichlet_) 1 MPI processes 76 type: preonly 77 maximum iterations=10000, initial guess is zero 78 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 79 left preconditioning 80 using NONE norm type for convergence test 81 PC Object: (pc_bddc_dirichlet_) 1 MPI processes 82 type: lu 83 out-of-place factorization 84 tolerance for zero pivot 2.22045e-14 85 matrix ordering: nd 86 factor fill ratio given 5., needed 1.7887 87 Factored matrix follows: 88 Mat Object: 1 MPI processes 89 type: seqaij 90 rows=195, cols=195 91 package used to perform factorization: petsc 92 total: nonzeros=4495, allocated nonzeros=4495 93 not using I-node routines 94 linear system matrix = precond matrix: 95 Mat Object: (pc_bddc_dirichlet_) 1 MPI processes 96 type: seqaij 97 rows=195, cols=195 98 total: nonzeros=2513, allocated nonzeros=2513 99 total number of mallocs used during MatSetValues calls=0 100 not using I-node routines 101 --- Correction solver (rank 0) 102 KSP Object: (pc_bddc_neumann_) 1 MPI processes 103 type: preonly 104 maximum iterations=10000, initial guess is zero 105 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 106 left preconditioning 107 using NONE norm type for convergence test 108 PC Object: (pc_bddc_neumann_) 1 MPI processes 109 type: lu 110 out-of-place factorization 111 tolerance for zero pivot 2.22045e-14 112 matrix ordering: nd 113 factor fill ratio given 5., needed 1.77676 114 Factored matrix follows: 115 Mat Object: 1 MPI processes 116 type: seqaij 117 rows=225, cols=225 118 package used to perform factorization: petsc 119 total: nonzeros=5627, allocated nonzeros=5627 120 not using I-node routines 121 linear system matrix = precond matrix: 122 Mat Object: (pc_bddc_neumann_) 1 MPI processes 123 type: seqaij 124 rows=225, cols=225 125 total: nonzeros=3167, allocated nonzeros=3167 126 total number of mallocs used during MatSetValues calls=0 127 not using I-node routines 128 --- Coarse solver 129 KSP Object: (pc_bddc_coarse_) 7 MPI processes 130 type: preonly 131 maximum iterations=1, initial guess is zero 132 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 133 left preconditioning 134 using NONE norm type for convergence test 135 PC Object: (pc_bddc_coarse_) 7 MPI processes 136 type: redundant 137 First (color=0) of 7 PCs follows 138 linear system matrix = precond matrix: 139 Mat Object: (pc_bddc_coarse_) 7 MPI processes 140 type: mpiaij 141 rows=21, cols=21 142 total: nonzeros=267, allocated nonzeros=319 143 total number of mallocs used during MatSetValues calls=0 144 using I-node (on process 0) routines: found 1 nodes, limit used is 5 145 KSP Object: (pc_bddc_coarse_redundant_) 1 MPI processes 146 type: preonly 147 maximum iterations=10000, initial guess is zero 148 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 149 left preconditioning 150 using NONE norm type for convergence test 151 PC Object: (pc_bddc_coarse_redundant_) 1 MPI processes 152 type: lu 153 out-of-place factorization 154 tolerance for zero pivot 2.22045e-14 155 matrix ordering: nd 156 factor fill ratio given 5., needed 1.35955 157 Factored matrix follows: 158 Mat Object: 1 MPI processes 159 type: seqaij 160 rows=21, cols=21 161 package used to perform factorization: petsc 162 total: nonzeros=363, allocated nonzeros=363 163 using I-node routines: found 10 nodes, limit used is 5 164 linear system matrix = precond matrix: 165 Mat Object: 1 MPI processes 166 type: seqaij 167 rows=21, cols=21 168 total: nonzeros=267, allocated nonzeros=267 169 total number of mallocs used during MatSetValues calls=0 170 using I-node routines: found 16 nodes, limit used is 5 171 linear system matrix = precond matrix: 172 Mat Object: 7 MPI processes 173 type: is 174 rows=1485, cols=1485 175 total: nonzeros=23366, allocated nonzeros=26623 176 total number of mallocs used during MatSetValues calls=0 177