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