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 using I-node routines: found 16 nodes, limit used is 5 106 linear system matrix = precond matrix: 107 Mat Object: 1 MPI processes 108 type: seqaij 109 rows=64, cols=64, bs=2 110 total: nonzeros=2304, allocated nonzeros=2304 111 total number of mallocs used during MatSetValues calls=0 112 using I-node routines: found 16 nodes, limit used is 5 113 linear system matrix = precond matrix: 114 Mat Object: 6 MPI processes 115 type: mpiaij 116 rows=64, cols=64, bs=2 117 total: nonzeros=2304, allocated nonzeros=2304 118 total number of mallocs used during MatSetValues calls=0 119 Down solver (pre-smoother) on level 1 ------------------------------- 120 KSP Object: (mg_levels_1_) 6 MPI processes 121 type: gmres 122 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 123 happy breakdown tolerance 1e-30 124 maximum iterations=1, nonzero initial guess 125 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 126 left preconditioning 127 using NONE norm type for convergence test 128 PC Object: (mg_levels_1_) 6 MPI processes 129 type: bjacobi 130 number of blocks = 6 131 Local solver is the same for all blocks, as in the following KSP and PC objects on rank 0: 132 KSP Object: (mg_levels_1_sub_) 1 MPI processes 133 type: preonly 134 maximum iterations=10000, initial guess is zero 135 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 136 left preconditioning 137 using NONE norm type for convergence test 138 PC Object: (mg_levels_1_sub_) 1 MPI processes 139 type: cholesky 140 out-of-place factorization 141 tolerance for zero pivot 2.22045e-14 142 matrix ordering: natural 143 factor fill ratio given 5., needed 1.32237 144 Factored matrix follows: 145 Mat Object: 1 MPI processes 146 type: seqsbaij 147 rows=48, cols=48, bs=2 148 package used to perform factorization: petsc 149 total: nonzeros=804, allocated nonzeros=804 150 block size is 2 151 linear system matrix = precond matrix: 152 Mat Object: 1 MPI processes 153 type: seqsbaij 154 rows=48, cols=48, bs=2 155 total: nonzeros=608, allocated nonzeros=608 156 total number of mallocs used during MatSetValues calls=0 157 block size is 2 158 linear system matrix = precond matrix: 159 Mat Object: 6 MPI processes 160 type: mpisbaij 161 rows=256, cols=256, bs=2 162 total: nonzeros=4864, allocated nonzeros=4864 163 total number of mallocs used during MatSetValues calls=0 164 Up solver (post-smoother) same as down solver (pre-smoother) 165 Down solver (pre-smoother) on level 2 ------------------------------- 166 KSP Object: (mg_levels_2_) 6 MPI processes 167 type: gmres 168 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 169 happy breakdown tolerance 1e-30 170 maximum iterations=1, nonzero initial guess 171 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 172 left preconditioning 173 using NONE norm type for convergence test 174 PC Object: (mg_levels_2_) 6 MPI processes 175 type: bjacobi 176 number of blocks = 6 177 Local solver is the same for all blocks, as in the following KSP and PC objects on rank 0: 178 KSP Object: (mg_levels_2_sub_) 1 MPI processes 179 type: preonly 180 maximum iterations=10000, initial guess is zero 181 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 182 left preconditioning 183 using NONE norm type for convergence test 184 PC Object: (mg_levels_2_sub_) 1 MPI processes 185 type: icc 186 out-of-place factorization 187 0 levels of fill 188 tolerance for zero pivot 2.22045e-14 189 using Manteuffel shift [POSITIVE_DEFINITE] 190 matrix ordering: natural 191 factor fill ratio given 1., needed 1.00133 192 Factored matrix follows: 193 Mat Object: 1 MPI processes 194 type: seqsbaij 195 rows=192, cols=192, bs=2 196 package used to perform factorization: petsc 197 total: nonzeros=3012, allocated nonzeros=3012 198 block size is 2 199 linear system matrix = precond matrix: 200 Mat Object: 1 MPI processes 201 type: seqsbaij 202 rows=192, cols=192, bs=2 203 total: nonzeros=3008, allocated nonzeros=3008 204 total number of mallocs used during MatSetValues calls=0 205 block size is 2 206 linear system matrix = precond matrix: 207 Mat Object: 6 MPI processes 208 type: mpisbaij 209 rows=1024, cols=1024, bs=2 210 total: nonzeros=19456, allocated nonzeros=19456 211 total number of mallocs used during MatSetValues calls=0 212 Up solver (post-smoother) same as down solver (pre-smoother) 213 Down solver (pre-smoother) on level 3 ------------------------------- 214 KSP Object: (mg_levels_3_) 6 MPI processes 215 type: gmres 216 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 217 happy breakdown tolerance 1e-30 218 maximum iterations=1, nonzero initial guess 219 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 220 left preconditioning 221 using NONE norm type for convergence test 222 PC Object: (mg_levels_3_) 6 MPI processes 223 type: bjacobi 224 number of blocks = 6 225 Local solver is the same for all blocks, as in the following KSP and PC objects on rank 0: 226 KSP Object: (mg_levels_3_sub_) 1 MPI processes 227 type: preonly 228 maximum iterations=10000, initial guess is zero 229 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 230 left preconditioning 231 using NONE norm type for convergence test 232 PC Object: (mg_levels_3_sub_) 1 MPI processes 233 type: icc 234 out-of-place factorization 235 0 levels of fill 236 tolerance for zero pivot 2.22045e-14 237 using Manteuffel shift [POSITIVE_DEFINITE] 238 matrix ordering: natural 239 factor fill ratio given 1., needed 1.00054 240 Factored matrix follows: 241 Mat Object: 1 MPI processes 242 type: seqsbaij 243 rows=384, cols=384, bs=2 244 package used to perform factorization: petsc 245 total: nonzeros=7428, allocated nonzeros=7428 246 block size is 2 247 linear system matrix = precond matrix: 248 Mat Object: 1 MPI processes 249 type: seqsbaij 250 rows=384, cols=384, bs=2 251 total: nonzeros=7424, allocated nonzeros=7424 252 total number of mallocs used during MatSetValues calls=0 253 block size is 2 254 linear system matrix = precond matrix: 255 Mat Object: 6 MPI processes 256 type: mpisbaij 257 rows=2048, cols=2048, bs=2 258 total: nonzeros=48128, allocated nonzeros=48128 259 total number of mallocs used during MatSetValues calls=0 260 Up solver (post-smoother) same as down solver (pre-smoother) 261 linear system matrix = precond matrix: 262 Mat Object: 6 MPI processes 263 type: mpisbaij 264 rows=2048, cols=2048, bs=2 265 total: nonzeros=48128, allocated nonzeros=48128 266 total number of mallocs used during MatSetValues calls=0 267Solution statistics after solve: Full 268CONVERGED_FNORM_RELATIVE: Number of SNES iterations = 5, total linear iterations = 22 269|X|_2 564267. -187.04 <= u <= 23814.8 -979.938 <= v <= 5720.23 3.24766 <= c <= 23904.5 270Surface statistics: u in [-6.945709e+01, 2.381387e+04] mean 1.520632e+04 271Global eta range 2.50736e+09 to 9.2273e+12 converged range 2.50736e+09 to 3.8249e+10 272Global beta2 range 0. to 4.97763e+09 converged range 0. to 4.97763e+09 273