1DM Object: Mesh 1 MPI processes 2 type: plex 3Mesh in 2 dimensions: 4 0-cells: 289 5 1-cells: 800 6 2-cells: 512 7Labels: 8 marker: 1 strata with value/size (1 (128)) 9 Face Sets: 1 strata with value/size (1 (120)) 10 depth: 3 strata with value/size (0 (289), 1 (800), 2 (512)) 11 DM_0x84000000_1 in 2 dimensions: 12 0-cells: 95 13 1-cells: 246 14 2-cells: 152 15 Labels: 16 _boundary_: 1 strata with value/size (1 (36)) 17 depth: 3 strata with value/size (0 (95), 1 (246), 2 (152)) 18 DM_0x84000000_2 in 2 dimensions: 19 0-cells: 38 20 1-cells: 91 21 2-cells: 54 22 Labels: 23 _boundary_: 1 strata with value/size (1 (20)) 24 depth: 3 strata with value/size (0 (38), 1 (91), 2 (54)) 25 DM_0x84000000_3 in 2 dimensions: 26 0-cells: 19 27 1-cells: 40 28 2-cells: 22 29 Labels: 30 _boundary_: 1 strata with value/size (1 (14)) 31 depth: 3 strata with value/size (0 (19), 1 (40), 2 (22)) 32 0 SNES Function norm 8.32828 33 0 KSP unpreconditioned resid norm 8.328278903362e+00 true resid norm 8.328278903362e+00 ||r(i)||/||b|| 1.000000000000e+00 34 1 KSP unpreconditioned resid norm 5.274358775793e-06 true resid norm 5.274358775793e-06 ||r(i)||/||b|| 6.333071739064e-07 35 2 KSP unpreconditioned resid norm 2.976750476392e-12 true resid norm 2.976750476392e-12 ||r(i)||/||b|| 3.574268478438e-13 36 1 SNES Function norm < 1.e-11 37L_2 Error: 0.00131794 38Nonlinear solve converged due to CONVERGED_FNORM_ABS iterations 1 39SNES Object: 1 MPI processes 40 type: newtonls 41 maximum iterations=50, maximum function evaluations=10000 42 tolerances: relative=0., absolute=1e-08, solution=1e-08 43 total number of linear solver iterations=2 44 total number of function evaluations=2 45 norm schedule ALWAYS 46 SNESLineSearch Object: 1 MPI processes 47 type: basic 48 maxstep=1.000000e+08, minlambda=1.000000e-12 49 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 50 maximum iterations=40 51 KSP Object: 1 MPI processes 52 type: richardson 53 damping factor=1. 54 maximum iterations=10000, initial guess is zero 55 tolerances: relative=0., absolute=1e-08, divergence=10000. 56 left preconditioning 57 using UNPRECONDITIONED norm type for convergence test 58 PC Object: 1 MPI processes 59 type: mg 60 type is MULTIPLICATIVE, levels=4 cycles=v 61 Cycles per PCApply=1 62 Not using Galerkin computed coarse grid matrices 63 Coarse grid solver -- level ------------------------------- 64 KSP Object: (mg_coarse_) 1 MPI processes 65 type: preonly 66 maximum iterations=10000, initial guess is zero 67 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 68 left preconditioning 69 using NONE norm type for convergence test 70 PC Object: (mg_coarse_) 1 MPI processes 71 type: lu 72 out-of-place factorization 73 tolerance for zero pivot 2.22045e-14 74 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 75 matrix ordering: nd 76 factor fill ratio given 5., needed 1. 77 Factored matrix follows: 78 Mat Object: 1 MPI processes 79 type: seqaij 80 rows=5, cols=5 81 package used to perform factorization: petsc 82 total: nonzeros=19, allocated nonzeros=19 83 total number of mallocs used during MatSetValues calls=0 84 not using I-node routines 85 linear system matrix = precond matrix: 86 Mat Object: 1 MPI processes 87 type: seqaij 88 rows=5, cols=5 89 total: nonzeros=19, allocated nonzeros=19 90 total number of mallocs used during MatSetValues calls=0 91 not using I-node routines 92 Down solver (pre-smoother) on level 1 ------------------------------- 93 KSP Object: (mg_levels_1_) 1 MPI processes 94 type: gmres 95 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 96 happy breakdown tolerance 1e-30 97 maximum iterations=10, nonzero initial guess 98 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 99 left preconditioning 100 using NONE norm type for convergence test 101 PC Object: (mg_levels_1_) 1 MPI processes 102 type: ilu 103 out-of-place factorization 104 0 levels of fill 105 tolerance for zero pivot 2.22045e-14 106 matrix ordering: natural 107 factor fill ratio given 1., needed 1. 108 Factored matrix follows: 109 Mat Object: 1 MPI processes 110 type: seqaij 111 rows=18, cols=18 112 package used to perform factorization: petsc 113 total: nonzeros=92, allocated nonzeros=92 114 total number of mallocs used during MatSetValues calls=0 115 not using I-node routines 116 linear system matrix = precond matrix: 117 Mat Object: 1 MPI processes 118 type: seqaij 119 rows=18, cols=18 120 total: nonzeros=92, allocated nonzeros=92 121 total number of mallocs used during MatSetValues calls=0 122 not using I-node routines 123 Up solver (post-smoother) same as down solver (pre-smoother) 124 Down solver (pre-smoother) on level 2 ------------------------------- 125 KSP Object: (mg_levels_2_) 1 MPI processes 126 type: gmres 127 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 128 happy breakdown tolerance 1e-30 129 maximum iterations=10, nonzero initial guess 130 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 131 left preconditioning 132 using NONE norm type for convergence test 133 PC Object: (mg_levels_2_) 1 MPI processes 134 type: ilu 135 out-of-place factorization 136 0 levels of fill 137 tolerance for zero pivot 2.22045e-14 138 matrix ordering: natural 139 factor fill ratio given 1., needed 1. 140 Factored matrix follows: 141 Mat Object: 1 MPI processes 142 type: seqaij 143 rows=59, cols=59 144 package used to perform factorization: petsc 145 total: nonzeros=353, allocated nonzeros=353 146 total number of mallocs used during MatSetValues calls=0 147 not using I-node routines 148 linear system matrix = precond matrix: 149 Mat Object: 1 MPI processes 150 type: seqaij 151 rows=59, cols=59 152 total: nonzeros=353, allocated nonzeros=353 153 total number of mallocs used during MatSetValues calls=0 154 not using I-node routines 155 Up solver (post-smoother) same as down solver (pre-smoother) 156 Down solver (pre-smoother) on level 3 ------------------------------- 157 KSP Object: (mg_levels_3_) 1 MPI processes 158 type: gmres 159 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 160 happy breakdown tolerance 1e-30 161 maximum iterations=10, nonzero initial guess 162 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 163 left preconditioning 164 using NONE norm type for convergence test 165 PC Object: (mg_levels_3_) 1 MPI processes 166 type: ilu 167 out-of-place factorization 168 0 levels of fill 169 tolerance for zero pivot 2.22045e-14 170 matrix ordering: natural 171 factor fill ratio given 1., needed 1. 172 Factored matrix follows: 173 Mat Object: 1 MPI processes 174 type: seqaij 175 rows=225, cols=225 176 package used to perform factorization: petsc 177 total: nonzeros=1457, allocated nonzeros=1457 178 total number of mallocs used during MatSetValues calls=0 179 not using I-node routines 180 linear system matrix = precond matrix: 181 Mat Object: 1 MPI processes 182 type: seqaij 183 rows=225, cols=225 184 total: nonzeros=1457, allocated nonzeros=1457 185 total number of mallocs used during MatSetValues calls=0 186 not using I-node routines 187 Up solver (post-smoother) same as down solver (pre-smoother) 188 linear system matrix = precond matrix: 189 Mat Object: 1 MPI processes 190 type: seqaij 191 rows=225, cols=225 192 total: nonzeros=1457, allocated nonzeros=1457 193 total number of mallocs used during MatSetValues calls=0 194 not using I-node routines 195