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