1Level 0 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000. 2 Linear solve converged due to CONVERGED_RTOL iterations 1 3 Linear solve converged due to CONVERGED_RTOL iterations 1 4 Linear solve converged due to CONVERGED_RTOL iterations 1 5 Linear solve converged due to CONVERGED_RTOL iterations 1 6 Linear solve converged due to CONVERGED_RTOL iterations 1 7 Linear solve converged due to CONVERGED_RTOL iterations 1 8 Linear solve converged due to CONVERGED_RTOL iterations 1 9 Linear solve converged due to CONVERGED_RTOL iterations 1 10 Linear solve converged due to CONVERGED_RTOL iterations 1 11 Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 9 12Level 1 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 8 x 8 x 2 (128), size (m) 10000. x 10000. x 1000. 13Level 0 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000. 14 Linear solve converged due to CONVERGED_RTOL iterations 4 15 Linear solve converged due to CONVERGED_RTOL iterations 5 16 Linear solve converged due to CONVERGED_RTOL iterations 5 17 Linear solve converged due to CONVERGED_RTOL iterations 6 18 Linear solve converged due to CONVERGED_RTOL iterations 6 19 Linear solve converged due to CONVERGED_RTOL iterations 5 20 Linear solve converged due to CONVERGED_RTOL iterations 6 21 Linear solve converged due to CONVERGED_RTOL iterations 7 22 Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 8 23Level 2 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 16 x 16 x 2 (512), size (m) 5000. x 5000. x 1000. 24Level 1 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 8 x 8 x 2 (128), size (m) 10000. x 10000. x 1000. 25Level 0 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000. 26 Linear solve converged due to CONVERGED_RTOL iterations 5 27 Linear solve converged due to CONVERGED_RTOL iterations 6 28 Linear solve converged due to CONVERGED_RTOL iterations 7 29 Linear solve converged due to CONVERGED_RTOL iterations 6 30 Linear solve converged due to CONVERGED_RTOL iterations 2 31 Linear solve converged due to CONVERGED_RTOL iterations 2 32 Linear solve converged due to CONVERGED_RTOL iterations 3 33 Linear solve converged due to CONVERGED_RTOL iterations 5 34 Linear solve converged due to CONVERGED_RTOL iterations 6 35 Linear solve converged due to CONVERGED_RTOL iterations 7 36 Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 10 37Level 3 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 16 x 16 x 4 (1024), size (m) 5000. x 5000. x 333.333 38Level 2 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 16 x 16 x 2 (512), size (m) 5000. x 5000. x 1000. 39Level 1 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 8 x 8 x 2 (128), size (m) 10000. x 10000. x 1000. 40Level 0 domain size (m) 8e+04 x 8e+04 x 1e+03, num elements 4 x 4 x 2 (32), size (m) 20000. x 20000. x 1000. 41 Linear solve converged due to CONVERGED_RTOL iterations 2 42 Linear solve converged due to CONVERGED_RTOL iterations 2 43 Linear solve converged due to CONVERGED_RTOL iterations 4 44 Linear solve converged due to CONVERGED_RTOL iterations 7 45 Linear solve converged due to CONVERGED_RTOL iterations 7 46Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 5 47SNES Object: 6 MPI processes 48 type: newtonls 49 maximum iterations=50, maximum function evaluations=10000 50 tolerances: relative=1e-08, absolute=1e-50, solution=1e-12 51 total number of linear solver iterations=22 52 total number of function evaluations=6 53 norm schedule ALWAYS 54 total number of grid sequence refinements=3 55 Jacobian is built using a DMDA local Jacobian 56 SNESLineSearch Object: 6 MPI processes 57 type: bt 58 interpolation: cubic 59 alpha=1.000000e-04 60 maxstep=1.000000e+08, minlambda=1.000000e-12 61 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 62 maximum iterations=40 63 KSP Object: 6 MPI processes 64 type: fgmres 65 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 66 happy breakdown tolerance 1e-30 67 maximum iterations=10000, initial guess is zero 68 tolerances: relative=0.01, absolute=-1., divergence=10000. 69 right preconditioning 70 using UNPRECONDITIONED norm type for convergence test 71 PC Object: 6 MPI processes 72 type: mg 73 type is MULTIPLICATIVE, levels=4 cycles=v 74 Cycles per PCApply=1 75 Not using Galerkin computed coarse grid matrices 76 Coarse grid solver -- level ------------------------------- 77 KSP Object: (mg_coarse_) 6 MPI processes 78 type: preonly 79 maximum iterations=10000, initial guess is zero 80 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 81 left preconditioning 82 using NONE norm type for convergence test 83 PC Object: (mg_coarse_) 6 MPI processes 84 type: redundant 85 First (color=0) of 6 PCs follows 86 KSP Object: (mg_coarse_redundant_) 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: (mg_coarse_redundant_) 1 MPI processes 93 type: lu 94 out-of-place factorization 95 tolerance for zero pivot 2.22045e-14 96 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 97 matrix ordering: nd 98 factor fill ratio given 5., needed 1.41667 99 Factored matrix follows: 100 Mat Object: 1 MPI processes 101 type: seqaij 102 rows=64, cols=64, bs=2 103 package used to perform factorization: petsc 104 total: nonzeros=3264, allocated nonzeros=3264 105 total number of mallocs used during MatSetValues calls=0 106 using I-node routines: found 16 nodes, limit used is 5 107 linear system matrix = precond matrix: 108 Mat Object: 1 MPI processes 109 type: seqaij 110 rows=64, cols=64, bs=2 111 total: nonzeros=2304, allocated nonzeros=2304 112 total number of mallocs used during MatSetValues calls=0 113 using I-node routines: found 16 nodes, limit used is 5 114 linear system matrix = precond matrix: 115 Mat Object: 6 MPI processes 116 type: mpiaij 117 rows=64, cols=64, bs=2 118 total: nonzeros=2304, allocated nonzeros=2304 119 total number of mallocs used during MatSetValues calls=0 120 Down solver (pre-smoother) on level 1 ------------------------------- 121 KSP Object: (mg_levels_1_) 6 MPI processes 122 type: gmres 123 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 124 happy breakdown tolerance 1e-30 125 maximum iterations=1, nonzero initial guess 126 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 127 left preconditioning 128 using NONE norm type for convergence test 129 PC Object: (mg_levels_1_) 6 MPI processes 130 type: bjacobi 131 number of blocks = 6 132 Local solve is same for all blocks, in the following KSP and PC objects: 133 KSP Object: (mg_levels_1_sub_) 1 MPI processes 134 type: preonly 135 maximum iterations=10000, initial guess is zero 136 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 137 left preconditioning 138 using NONE norm type for convergence test 139 PC Object: (mg_levels_1_sub_) 1 MPI processes 140 type: cholesky 141 out-of-place factorization 142 tolerance for zero pivot 2.22045e-14 143 matrix ordering: natural 144 factor fill ratio given 5., needed 1.32237 145 Factored matrix follows: 146 Mat Object: 1 MPI processes 147 type: seqsbaij 148 rows=48, cols=48, bs=2 149 package used to perform factorization: petsc 150 total: nonzeros=804, allocated nonzeros=804 151 total number of mallocs used during MatSetValues calls=0 152 block size is 2 153 linear system matrix = precond matrix: 154 Mat Object: 1 MPI processes 155 type: seqsbaij 156 rows=48, cols=48, bs=2 157 total: nonzeros=608, allocated nonzeros=608 158 total number of mallocs used during MatSetValues calls=0 159 block size is 2 160 linear system matrix = precond matrix: 161 Mat Object: 6 MPI processes 162 type: mpisbaij 163 rows=256, cols=256, bs=2 164 total: nonzeros=4864, allocated nonzeros=4864 165 total number of mallocs used during MatSetValues calls=0 166 Up solver (post-smoother) same as down solver (pre-smoother) 167 Down solver (pre-smoother) on level 2 ------------------------------- 168 KSP Object: (mg_levels_2_) 6 MPI processes 169 type: gmres 170 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 171 happy breakdown tolerance 1e-30 172 maximum iterations=1, nonzero initial guess 173 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 174 left preconditioning 175 using NONE norm type for convergence test 176 PC Object: (mg_levels_2_) 6 MPI processes 177 type: bjacobi 178 number of blocks = 6 179 Local solve is same for all blocks, in the following KSP and PC objects: 180 KSP Object: (mg_levels_2_sub_) 1 MPI processes 181 type: preonly 182 maximum iterations=10000, initial guess is zero 183 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 184 left preconditioning 185 using NONE norm type for convergence test 186 PC Object: (mg_levels_2_sub_) 1 MPI processes 187 type: icc 188 out-of-place factorization 189 0 levels of fill 190 tolerance for zero pivot 2.22045e-14 191 using Manteuffel shift [POSITIVE_DEFINITE] 192 matrix ordering: natural 193 factor fill ratio given 1., needed 1.00133 194 Factored matrix follows: 195 Mat Object: 1 MPI processes 196 type: seqsbaij 197 rows=192, cols=192, bs=2 198 package used to perform factorization: petsc 199 total: nonzeros=3012, allocated nonzeros=3012 200 total number of mallocs used during MatSetValues calls=0 201 block size is 2 202 linear system matrix = precond matrix: 203 Mat Object: 1 MPI processes 204 type: seqsbaij 205 rows=192, cols=192, bs=2 206 total: nonzeros=3008, allocated nonzeros=3008 207 total number of mallocs used during MatSetValues calls=0 208 block size is 2 209 linear system matrix = precond matrix: 210 Mat Object: 6 MPI processes 211 type: mpisbaij 212 rows=1024, cols=1024, bs=2 213 total: nonzeros=19456, allocated nonzeros=19456 214 total number of mallocs used during MatSetValues calls=0 215 Up solver (post-smoother) same as down solver (pre-smoother) 216 Down solver (pre-smoother) on level 3 ------------------------------- 217 KSP Object: (mg_levels_3_) 6 MPI processes 218 type: gmres 219 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 220 happy breakdown tolerance 1e-30 221 maximum iterations=1, nonzero initial guess 222 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 223 left preconditioning 224 using NONE norm type for convergence test 225 PC Object: (mg_levels_3_) 6 MPI processes 226 type: bjacobi 227 number of blocks = 6 228 Local solve is same for all blocks, in the following KSP and PC objects: 229 KSP Object: (mg_levels_3_sub_) 1 MPI processes 230 type: preonly 231 maximum iterations=10000, initial guess is zero 232 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 233 left preconditioning 234 using NONE norm type for convergence test 235 PC Object: (mg_levels_3_sub_) 1 MPI processes 236 type: icc 237 out-of-place factorization 238 0 levels of fill 239 tolerance for zero pivot 2.22045e-14 240 using Manteuffel shift [POSITIVE_DEFINITE] 241 matrix ordering: natural 242 factor fill ratio given 1., needed 1.00054 243 Factored matrix follows: 244 Mat Object: 1 MPI processes 245 type: seqsbaij 246 rows=384, cols=384, bs=2 247 package used to perform factorization: petsc 248 total: nonzeros=7428, allocated nonzeros=7428 249 total number of mallocs used during MatSetValues calls=0 250 block size is 2 251 linear system matrix = precond matrix: 252 Mat Object: 1 MPI processes 253 type: seqsbaij 254 rows=384, cols=384, bs=2 255 total: nonzeros=7424, allocated nonzeros=7424 256 total number of mallocs used during MatSetValues calls=0 257 block size is 2 258 linear system matrix = precond matrix: 259 Mat Object: 6 MPI processes 260 type: mpisbaij 261 rows=2048, cols=2048, bs=2 262 total: nonzeros=48128, allocated nonzeros=48128 263 total number of mallocs used during MatSetValues calls=0 264 Up solver (post-smoother) same as down solver (pre-smoother) 265 linear system matrix = precond matrix: 266 Mat Object: 6 MPI processes 267 type: mpisbaij 268 rows=2048, cols=2048, bs=2 269 total: nonzeros=48128, allocated nonzeros=48128 270 total number of mallocs used during MatSetValues calls=0 271Solution statistics after solve: Full 272CONVERGED_FNORM_RELATIVE: Number of SNES iterations = 5, total linear iterations = 22 273|X|_2 564267. -187.04 <= u <= 23814.8 -979.938 <= v <= 5720.23 3.24766 <= c <= 23904.5 274Surface statistics: u in [-6.945709e+01, 2.381387e+04] mean 1.520632e+04 275Global eta range 2.50736e+09 to 9.2273e+12 converged range 2.50736e+09 to 3.8249e+10 276Global beta2 range 0. to 4.97763e+09 converged range 0. to 4.97763e+09 277