1 0 SNES Function norm 8.32828 2 0 KSP unpreconditioned resid norm 8.328278903362e+00 true resid norm 8.328278903362e+00 ||r(i)||/||b|| 1.000000000000e+00 3 1 KSP unpreconditioned resid norm 1.577431790565e-04 true resid norm 1.577431790565e-04 ||r(i)||/||b|| 1.894066960135e-05 4 2 KSP unpreconditioned resid norm 1.103738275186e-08 true resid norm 1.103738275186e-08 ||r(i)||/||b|| 1.325289760337e-09 5 3 KSP unpreconditioned resid norm 7.232926360782e-13 true resid norm 7.232926360782e-13 ||r(i)||/||b|| 8.684779225948e-14 6 1 SNES Function norm < 1.e-11 7L_2 Error: 0.00131794 8Nonlinear solve converged due to CONVERGED_FNORM_ABS iterations 1 9SNES Object: 1 MPI process 10 type: newtonls 11 maximum iterations=50, maximum function evaluations=10000 12 tolerances: relative=0., absolute=1e-08, solution=1e-08 13 total number of linear solver iterations=3 14 total number of function evaluations=2 15 norm schedule ALWAYS 16 SNESLineSearch Object: 1 MPI process 17 type: bt 18 interpolation: cubic 19 alpha=1.000000e-04 20 maxlambda=1.000000e+00, minlambda=1.000000e-12 21 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 22 maximum iterations=40 23 KSP Object: 1 MPI process 24 type: richardson 25 damping factor=1. 26 maximum iterations=10000, initial guess is zero 27 tolerances: relative=0., absolute=1e-08, divergence=10000. 28 left preconditioning 29 using UNPRECONDITIONED norm type for convergence test 30 PC Object: 1 MPI process 31 type: mg 32 type is MULTIPLICATIVE, levels=4 cycles=v 33 Cycles per PCApply=1 34 Not using Galerkin computed coarse grid matrices 35 Coarse grid solver -- level 0 ------------------------------- 36 KSP Object: (mg_coarse_) 1 MPI process 37 type: preonly 38 maximum iterations=10000, initial guess is zero 39 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 40 left preconditioning 41 not checking for convergence 42 PC Object: (mg_coarse_) 1 MPI process 43 type: lu 44 out-of-place factorization 45 tolerance for zero pivot 2.22045e-14 46 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 47 matrix ordering: nd 48 factor fill ratio given 5., needed 1. 49 Factored matrix: 50 Mat Object: (mg_coarse_) 1 MPI process 51 type: seqaij 52 rows=4, cols=4 53 package used to perform factorization: petsc 54 total: nonzeros=14, allocated nonzeros=14 55 using I-node routines: found 3 nodes, limit used is 5 56 linear system matrix, which is also used to construct the preconditioner: 57 Mat Object: 1 MPI process 58 type: seqaij 59 rows=4, cols=4 60 total: nonzeros=14, allocated nonzeros=14 61 total number of mallocs used during MatSetValues calls=0 62 not using I-node routines 63 Down solver (pre-smoother) on level 1 ------------------------------- 64 KSP Object: (mg_levels_1_) 1 MPI process 65 type: gmres 66 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 67 happy breakdown tolerance=1e-30 68 maximum iterations=10, nonzero initial guess 69 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 70 left preconditioning 71 not checking for convergence 72 PC Object: (mg_levels_1_) 1 MPI process 73 type: ilu 74 out-of-place factorization 75 0 levels of fill 76 tolerance for zero pivot 2.22045e-14 77 matrix ordering: natural 78 factor fill ratio given 1., needed 1. 79 Factored matrix: 80 Mat Object: (mg_levels_1_) 1 MPI process 81 type: seqaij 82 rows=15, cols=15 83 package used to perform factorization: petsc 84 total: nonzeros=73, allocated nonzeros=73 85 not using I-node routines 86 linear system matrix, which is also used to construct the preconditioner: 87 Mat Object: 1 MPI process 88 type: seqaij 89 rows=15, cols=15 90 total: nonzeros=73, allocated nonzeros=73 91 total number of mallocs used during MatSetValues calls=0 92 not using I-node routines 93 Up solver (post-smoother) same as down solver (pre-smoother) 94 Down solver (pre-smoother) on level 2 ------------------------------- 95 KSP Object: (mg_levels_2_) 1 MPI process 96 type: gmres 97 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 98 happy breakdown tolerance=1e-30 99 maximum iterations=10, nonzero initial guess 100 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 101 left preconditioning 102 not checking for convergence 103 PC Object: (mg_levels_2_) 1 MPI process 104 type: ilu 105 out-of-place factorization 106 0 levels of fill 107 tolerance for zero pivot 2.22045e-14 108 matrix ordering: natural 109 factor fill ratio given 1., needed 1. 110 Factored matrix: 111 Mat Object: (mg_levels_2_) 1 MPI process 112 type: seqaij 113 rows=59, cols=59 114 package used to perform factorization: petsc 115 total: nonzeros=347, allocated nonzeros=347 116 not using I-node routines 117 linear system matrix, which is also used to construct the preconditioner: 118 Mat Object: 1 MPI process 119 type: seqaij 120 rows=59, cols=59 121 total: nonzeros=347, allocated nonzeros=347 122 total number of mallocs used during MatSetValues calls=0 123 not using I-node routines 124 Up solver (post-smoother) same as down solver (pre-smoother) 125 Down solver (pre-smoother) on level 3 ------------------------------- 126 KSP Object: (mg_levels_3_) 1 MPI process 127 type: gmres 128 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 129 happy breakdown tolerance=1e-30 130 maximum iterations=10, nonzero initial guess 131 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 132 left preconditioning 133 not checking for convergence 134 PC Object: (mg_levels_3_) 1 MPI process 135 type: ilu 136 out-of-place factorization 137 0 levels of fill 138 tolerance for zero pivot 2.22045e-14 139 matrix ordering: natural 140 factor fill ratio given 1., needed 1. 141 Factored matrix: 142 Mat Object: (mg_levels_3_) 1 MPI process 143 type: seqaij 144 rows=225, cols=225 145 package used to perform factorization: petsc 146 total: nonzeros=1457, allocated nonzeros=1457 147 not using I-node routines 148 linear system matrix, which is also used to construct the preconditioner: 149 Mat Object: 1 MPI process 150 type: seqaij 151 rows=225, cols=225 152 total: nonzeros=1457, allocated nonzeros=1457 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 linear system matrix, which is also used to construct the preconditioner: 157 Mat Object: 1 MPI process 158 type: seqaij 159 rows=225, cols=225 160 total: nonzeros=1457, allocated nonzeros=1457 161 total number of mallocs used during MatSetValues calls=0 162 not using I-node routines 163