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