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 maxlambda=1.000000e+00, 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 0 ------------------------------- 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 not checking for convergence 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 process 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 not checking for convergence 92 PC Object: (mg_coarse_redundant_) 1 MPI process 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: 100 Mat Object: (mg_coarse_redundant_) 1 MPI process 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, which is also used to construct the preconditioner: 107 Mat Object: 1 MPI process 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, which is also used to construct the preconditioner: 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 not checking for convergence 128 PC Object: (mg_levels_1_) 6 MPI processes 129 type: bjacobi 130 number of blocks = 6 131 Local solver information for first block is in the following KSP and PC objects on rank 0: 132 Use -mg_levels_1_ksp_view ::ascii_info_detail to display information for all blocks 133 KSP Object: (mg_levels_1_sub_) 1 MPI process 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 not checking for convergence 139 PC Object: (mg_levels_1_sub_) 1 MPI process 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: 146 Mat Object: (mg_levels_1_sub_) 1 MPI process 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 linear system matrix, which is also used to construct the preconditioner: 152 Mat Object: (mg_levels_1_sub_) 1 MPI process 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 linear system matrix, which is also used to construct the preconditioner: 158 Mat Object: 6 MPI processes 159 type: mpisbaij 160 rows=256, cols=256, bs=2 161 total: nonzeros=4864, allocated nonzeros=4864 162 total number of mallocs used during MatSetValues calls=0 163 Up solver (post-smoother) same as down solver (pre-smoother) 164 Down solver (pre-smoother) on level 2 ------------------------------- 165 KSP Object: (mg_levels_2_) 6 MPI processes 166 type: gmres 167 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 168 happy breakdown tolerance=1e-30 169 maximum iterations=1, nonzero initial guess 170 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 171 left preconditioning 172 not checking for convergence 173 PC Object: (mg_levels_2_) 6 MPI processes 174 type: bjacobi 175 number of blocks = 6 176 Local solver information for first block is in the following KSP and PC objects on rank 0: 177 Use -mg_levels_2_ksp_view ::ascii_info_detail to display information for all blocks 178 KSP Object: (mg_levels_2_sub_) 1 MPI process 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 not checking for convergence 184 PC Object: (mg_levels_2_sub_) 1 MPI process 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: 193 Mat Object: (mg_levels_2_sub_) 1 MPI process 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 linear system matrix, which is also used to construct the preconditioner: 199 Mat Object: (mg_levels_2_sub_) 1 MPI process 200 type: seqsbaij 201 rows=192, cols=192, bs=2 202 total: nonzeros=3008, allocated nonzeros=3008 203 total number of mallocs used during MatSetValues calls=0 204 linear system matrix, which is also used to construct the preconditioner: 205 Mat Object: 6 MPI processes 206 type: mpisbaij 207 rows=1024, cols=1024, bs=2 208 total: nonzeros=19456, allocated nonzeros=19456 209 total number of mallocs used during MatSetValues calls=0 210 Up solver (post-smoother) same as down solver (pre-smoother) 211 Down solver (pre-smoother) on level 3 ------------------------------- 212 KSP Object: (mg_levels_3_) 6 MPI processes 213 type: gmres 214 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 215 happy breakdown tolerance=1e-30 216 maximum iterations=1, nonzero initial guess 217 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 218 left preconditioning 219 not checking for convergence 220 PC Object: (mg_levels_3_) 6 MPI processes 221 type: bjacobi 222 number of blocks = 6 223 Local solver information for first block is in the following KSP and PC objects on rank 0: 224 Use -mg_levels_3_ksp_view ::ascii_info_detail to display information for all blocks 225 KSP Object: (mg_levels_3_sub_) 1 MPI process 226 type: preonly 227 maximum iterations=10000, initial guess is zero 228 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 229 left preconditioning 230 not checking for convergence 231 PC Object: (mg_levels_3_sub_) 1 MPI process 232 type: icc 233 out-of-place factorization 234 0 levels of fill 235 tolerance for zero pivot 2.22045e-14 236 using Manteuffel shift [POSITIVE_DEFINITE] 237 matrix ordering: natural 238 factor fill ratio given 1., needed 1.00054 239 Factored matrix: 240 Mat Object: (mg_levels_3_sub_) 1 MPI process 241 type: seqsbaij 242 rows=384, cols=384, bs=2 243 package used to perform factorization: petsc 244 total: nonzeros=7428, allocated nonzeros=7428 245 linear system matrix, which is also used to construct the preconditioner: 246 Mat Object: (mg_levels_3_sub_) 1 MPI process 247 type: seqsbaij 248 rows=384, cols=384, bs=2 249 total: nonzeros=7424, allocated nonzeros=7424 250 total number of mallocs used during MatSetValues calls=0 251 linear system matrix, which is also used to construct the preconditioner: 252 Mat Object: 6 MPI processes 253 type: mpisbaij 254 rows=2048, cols=2048, bs=2 255 total: nonzeros=48128, allocated nonzeros=48128 256 total number of mallocs used during MatSetValues calls=0 257 Up solver (post-smoother) same as down solver (pre-smoother) 258 linear system matrix, which is also used to construct the preconditioner: 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 264Solution statistics after solve: Full 265CONVERGED_FNORM_RELATIVE: Number of SNES iterations = 5, total linear iterations = 22 266|X|_2 564267. -187.04 <= u <= 23814.8 -979.938 <= v <= 5720.23 3.24766 <= c <= 23904.5 267Surface statistics: u in [-6.945709e+01, 2.381387e+04] mean 1.520632e+04 268Global eta range 2.50736e+09 to 9.2273e+12 converged range 2.50736e+09 to 3.8249e+10 269Global beta2 range 0. to 4.97763e+09 converged range 0. to 4.97763e+09 270