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 11 L_2 Error: 0.00524438 12 Nonlinear 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 maxlambda=1.000000e+00, 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 Corner selection: 0 (selected 0) 42 Use vertices: 1 (vertex size 1) 43 Use edges: 1 44 Use faces: 0 45 Use true near null space: 0 46 Use QR for single constraints on cc: 0 47 Use change of basis on local edge nodes: 0 48 Use change of basis on local face nodes: 0 49 User defined change of basis matrix: 0 50 Has change of basis matrix: 0 51 Eliminate dirichlet boundary dofs: 0 52 Switch on static condensation ops around the interface preconditioner: 0 53 Use exact dirichlet trick: 0 54 Interface extension: DIRICHLET 55 Multilevel max levels: 0 56 Multilevel coarsening ratio: 8 57 Use estimated eigs for coarse problem: 0 58 Use deluxe scaling: 0 59 Use deluxe zerorows: 0 60 Use deluxe singlemat: 0 61 Rebuild interface graph for Schur principal minors: 0 62 Number of dofs' layers for the computation of principal minors: -1 63 Use user CSR graph to compute successive layers: 0 64 Adaptive constraint selection threshold (active 0, userdefined 0): 0. 65 Min constraints / connected component: 0 66 Max constraints / connected component: 0 67 Invert exact Schur complement for adaptive selection: 0 68 Symmetric computation of primal basis functions: 1 69 Num. Procs. to map coarse adjacency list: 0 70 Coarse eqs per proc (significant at the coarsest level): 1 71 Detect disconnected: 0 (filter 0) 72 Benign subspace trick: 0 (change explicit 0) 73 Benign subspace trick is active: 0 74 Algebraic computation of no-net-flux: 0 75 ********************************** STATISTICS AT LEVEL 0 ********************************** 76 Global dofs sizes: all 49 interface 25 coarse 9 77 Coarsening ratios: all/coarse 5 interface/coarse 2 78 Active processes : 5 79 Total subdomains : 5 80 Dofs type : MIN MAX MEAN 81 Interior dofs : 3 6 4 82 Interface dofs : 7 16 10 83 Primal dofs : 3 6 4 84 Local dofs : 10 22 15 85 Local subs : 1 1 86 --- Interior solver (rank 0) 87 KSP Object: (pc_bddc_dirichlet_) 1 MPI process 88 type: preonly 89 maximum iterations=10000, initial guess is zero 90 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 91 left preconditioning 92 not checking for convergence 93 PC Object: (pc_bddc_dirichlet_) 1 MPI process 94 type: lu 95 out-of-place factorization 96 tolerance for zero pivot 2.22045e-14 97 matrix ordering: nd 98 factor fill ratio given 5., needed 1. 99 Factored matrix: 100 Mat Object: (pc_bddc_dirichlet_) 1 MPI process 101 type: seqaij 102 rows=6, cols=6 103 package used to perform factorization: petsc 104 total: nonzeros=18, allocated nonzeros=18 105 using I-node routines: found 2 nodes, limit used is 5 106 linear system matrix, which is also used to construct the preconditioner: 107 Mat Object: (pc_bddc_dirichlet_) 1 MPI process 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 process 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 not checking for convergence 120 PC Object: (pc_bddc_neumann_) 1 MPI process 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.09231 126 Factored matrix: 127 Mat Object: (pc_bddc_neumann_) 1 MPI process 128 type: seqaij 129 rows=15, cols=15 130 package used to perform factorization: petsc 131 total: nonzeros=71, allocated nonzeros=71 132 not using I-node routines 133 linear system matrix, which is also used to construct the preconditioner: 134 Mat Object: (pc_bddc_neumann_) 1 MPI process 135 type: seqaij 136 rows=15, cols=15 137 total: nonzeros=65, allocated nonzeros=65 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 not checking for convergence 147 PC Object: (pc_bddc_coarse_) 5 MPI processes 148 type: redundant 149 First (color=0) of 5 PCs follows 150 KSP Object: (pc_bddc_coarse_redundant_) 1 MPI process 151 type: preonly 152 maximum iterations=10000, initial guess is zero 153 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 154 left preconditioning 155 not checking for convergence 156 PC Object: (pc_bddc_coarse_redundant_) 1 MPI process 157 type: lu 158 out-of-place factorization 159 tolerance for zero pivot 2.22045e-14 160 matrix ordering: nd 161 factor fill ratio given 5., needed 1.13115 162 Factored matrix: 163 Mat Object: (pc_bddc_coarse_redundant_) 1 MPI process 164 type: seqaij 165 rows=9, cols=9 166 package used to perform factorization: petsc 167 total: nonzeros=69, allocated nonzeros=69 168 using I-node routines: found 5 nodes, limit used is 5 169 linear system matrix, which is also used to construct the preconditioner: 170 Mat Object: 1 MPI process 171 type: seqaij 172 rows=9, cols=9 173 total: nonzeros=61, allocated nonzeros=61 174 total number of mallocs used during MatSetValues calls=0 175 using I-node routines: found 7 nodes, limit used is 5 176 linear system matrix, which is also used to construct the preconditioner: 177 Mat Object: (pc_bddc_coarse_) 5 MPI processes 178 type: mpiaij 179 rows=9, cols=9 180 total: nonzeros=61, allocated nonzeros=61 181 total number of mallocs used during MatSetValues calls=0 182 using I-node (on process 0) routines: found 1 nodes, limit used is 5 183 linear system matrix, which is also used to construct the preconditioner: 184 Mat Object: 5 MPI processes 185 type: is 186 rows=49, cols=49 187 total: nonzeros=361, allocated nonzeros=463 188 total number of mallocs used during MatSetValues calls=0 189