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 follows: 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 = precond matrix: 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 = 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 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 follows: 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 block size is 2 152 linear system matrix = precond matrix: 153 Mat Object: (mg_levels_1_sub_) 1 MPI process 154 type: seqsbaij 155 rows=48, cols=48, bs=2 156 total: nonzeros=608, allocated nonzeros=608 157 total number of mallocs used during MatSetValues calls=0 158 block size is 2 159 linear system matrix = precond matrix: 160 Mat Object: 6 MPI processes 161 type: mpisbaij 162 rows=256, cols=256, bs=2 163 total: nonzeros=4864, allocated nonzeros=4864 164 total number of mallocs used during MatSetValues calls=0 165 Up solver (post-smoother) same as down solver (pre-smoother) 166 Down solver (pre-smoother) on level 2 ------------------------------- 167 KSP Object: (mg_levels_2_) 6 MPI processes 168 type: gmres 169 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 170 happy breakdown tolerance 1e-30 171 maximum iterations=1, nonzero initial guess 172 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 173 left preconditioning 174 not checking for convergence 175 PC Object: (mg_levels_2_) 6 MPI processes 176 type: bjacobi 177 number of blocks = 6 178 Local solver information for first block is in the following KSP and PC objects on rank 0: 179 Use -mg_levels_2_ksp_view ::ascii_info_detail to display information for all blocks 180 KSP Object: (mg_levels_2_sub_) 1 MPI process 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 not checking for convergence 186 PC Object: (mg_levels_2_sub_) 1 MPI process 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: (mg_levels_2_sub_) 1 MPI process 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 block size is 2 201 linear system matrix = precond matrix: 202 Mat Object: (mg_levels_2_sub_) 1 MPI process 203 type: seqsbaij 204 rows=192, cols=192, bs=2 205 total: nonzeros=3008, allocated nonzeros=3008 206 total number of mallocs used during MatSetValues calls=0 207 block size is 2 208 linear system matrix = precond matrix: 209 Mat Object: 6 MPI processes 210 type: mpisbaij 211 rows=1024, cols=1024, bs=2 212 total: nonzeros=19456, allocated nonzeros=19456 213 total number of mallocs used during MatSetValues calls=0 214 Up solver (post-smoother) same as down solver (pre-smoother) 215 Down solver (pre-smoother) on level 3 ------------------------------- 216 KSP Object: (mg_levels_3_) 6 MPI processes 217 type: gmres 218 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 219 happy breakdown tolerance 1e-30 220 maximum iterations=1, nonzero initial guess 221 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 222 left preconditioning 223 not checking for convergence 224 PC Object: (mg_levels_3_) 6 MPI processes 225 type: bjacobi 226 number of blocks = 6 227 Local solver information for first block is in the following KSP and PC objects on rank 0: 228 Use -mg_levels_3_ksp_view ::ascii_info_detail to display information for all blocks 229 KSP Object: (mg_levels_3_sub_) 1 MPI process 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 not checking for convergence 235 PC Object: (mg_levels_3_sub_) 1 MPI process 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: (mg_levels_3_sub_) 1 MPI process 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 block size is 2 250 linear system matrix = precond matrix: 251 Mat Object: (mg_levels_3_sub_) 1 MPI process 252 type: seqsbaij 253 rows=384, cols=384, bs=2 254 total: nonzeros=7424, allocated nonzeros=7424 255 total number of mallocs used during MatSetValues calls=0 256 block size is 2 257 linear system matrix = precond matrix: 258 Mat Object: 6 MPI processes 259 type: mpisbaij 260 rows=2048, cols=2048, bs=2 261 total: nonzeros=48128, allocated nonzeros=48128 262 total number of mallocs used during MatSetValues calls=0 263 Up solver (post-smoother) same as down solver (pre-smoother) 264 linear system matrix = precond matrix: 265 Mat Object: 6 MPI processes 266 type: mpisbaij 267 rows=2048, cols=2048, bs=2 268 total: nonzeros=48128, allocated nonzeros=48128 269 total number of mallocs used during MatSetValues calls=0 270Solution statistics after solve: Full 271CONVERGED_FNORM_RELATIVE: Number of SNES iterations = 5, total linear iterations = 22 272|X|_2 564267. -187.04 <= u <= 23814.8 -979.938 <= v <= 5720.23 3.24766 <= c <= 23904.5 273Surface statistics: u in [-6.945709e+01, 2.381387e+04] mean 1.520632e+04 274Global eta range 2.50736e+09 to 9.2273e+12 converged range 2.50736e+09 to 3.8249e+10 275Global beta2 range 0. to 4.97763e+09 converged range 0. to 4.97763e+09 276