1 0 SNES Function norm 0.995735 2 Linear solve converged due to CONVERGED_RTOL iterations 3 3 1 SNES Function norm 0.276938 4 Linear solve converged due to CONVERGED_RTOL iterations 3 5 2 SNES Function norm 0.00668678 6 Linear solve converged due to CONVERGED_RTOL iterations 2 7 3 SNES Function norm 4.61502e-06 8 Linear solve converged due to CONVERGED_RTOL iterations 2 9 4 SNES Function norm 1.568e-11 10 0 SNES Function norm 0.0763997 11 Linear solve converged due to CONVERGED_RTOL iterations 2 12 1 SNES Function norm 2.67906e-05 13 Linear solve converged due to CONVERGED_RTOL iterations 2 14 2 SNES Function norm 9.312e-11 15 0 SNES Function norm 0.0408394 16 Linear solve converged due to CONVERGED_RTOL iterations 2 17 1 SNES Function norm 9.10598e-07 18 Linear solve converged due to CONVERGED_RTOL iterations 2 19 2 SNES Function norm < 1.e-11 20 0 SNES Function norm 0.021012 21 Linear solve converged due to CONVERGED_RTOL iterations 2 22 1 SNES Function norm 3.84069e-08 23 Linear solve converged due to CONVERGED_RTOL iterations 2 24 2 SNES Function norm < 1.e-11 25SNES Object: 1 MPI process 26 type: newtonls 27 maximum iterations=50, maximum function evaluations=10000 28 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 29 total number of linear solver iterations=22 30 total number of function evaluations=14 31 norm schedule ALWAYS 32 total number of grid sequence refinements=3 33 Jacobian is built using a DMDA local Jacobian 34 SNESLineSearch Object: 1 MPI process 35 type: bt 36 interpolation: cubic 37 alpha=1.000000e-04 38 maxlambda=1.000000e+00, minlambda=1.000000e-12 39 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 40 maximum iterations=40 41 KSP Object: 1 MPI process 42 type: gmres 43 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 44 happy breakdown tolerance=1e-30 45 maximum iterations=10000, initial guess is zero 46 tolerances: relative=1e-05, absolute=-1., divergence=10000. 47 left preconditioning 48 using PRECONDITIONED norm type for convergence test 49 PC Object: 1 MPI process 50 type: mg 51 type is FULL, levels=4 cycles=v 52 Using Galerkin computed coarse grid matrices for pmat 53 Coarse grid solver -- level 0 ------------------------------- 54 KSP Object: (mg_coarse_) 1 MPI process 55 type: preonly 56 maximum iterations=10000, initial guess is zero 57 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 58 left preconditioning 59 not checking for convergence 60 PC Object: (mg_coarse_) 1 MPI process 61 type: lu 62 out-of-place factorization 63 tolerance for zero pivot 2.22045e-14 64 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 65 matrix ordering: nd 66 factor fill ratio given 5., needed 1.42 67 Factored matrix: 68 Mat Object: (mg_coarse_) 1 MPI process 69 type: seqaij 70 rows=16, cols=16 71 package used to perform factorization: petsc 72 total: nonzeros=142, allocated nonzeros=142 73 using I-node routines: found 11 nodes, limit used is 5 74 linear system matrix, which is also used to construct the preconditioner: 75 Mat Object: 1 MPI process 76 type: seqaij 77 rows=16, cols=16 78 total: nonzeros=100, allocated nonzeros=100 79 total number of mallocs used during MatSetValues calls=0 80 not using I-node routines 81 Down solver (pre-smoother) on level 1 ------------------------------- 82 KSP Object: (mg_levels_1_) 1 MPI process 83 type: chebyshev 84 Chebyshev polynomial of first kind 85 eigenvalue targets used: min 0.49992, max 1.09982 86 eigenvalues estimated via gmres: min 0.38164, max 0.999839 87 eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 88 KSP Object: (mg_levels_1_esteig_) 1 MPI process 89 type: gmres 90 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 91 happy breakdown tolerance=1e-30 92 maximum iterations=10, initial guess is zero 93 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 94 left preconditioning 95 using PRECONDITIONED norm type for convergence test 96 estimating eigenvalues using a noisy random number generated right-hand side 97 maximum iterations=2, nonzero initial guess 98 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 99 left preconditioning 100 not checking for convergence 101 PC Object: (mg_levels_1_) 1 MPI process 102 type: sor 103 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 104 linear system matrix, which is also used to construct the preconditioner: 105 Mat Object: 1 MPI process 106 type: seqaij 107 rows=49, cols=49 108 total: nonzeros=361, allocated nonzeros=361 109 total number of mallocs used during MatSetValues calls=0 110 not using I-node routines 111 Up solver (post-smoother) same as down solver (pre-smoother) 112 Down solver (pre-smoother) on level 2 ------------------------------- 113 KSP Object: (mg_levels_2_) 1 MPI process 114 type: chebyshev 115 Chebyshev polynomial of first kind 116 eigenvalue targets used: min 0.498238, max 1.09612 117 eigenvalues estimated via gmres: min 0.11325, max 0.996475 118 eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 119 KSP Object: (mg_levels_2_esteig_) 1 MPI process 120 type: gmres 121 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 122 happy breakdown tolerance=1e-30 123 maximum iterations=10, initial guess is zero 124 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 125 left preconditioning 126 using PRECONDITIONED norm type for convergence test 127 estimating eigenvalues using a noisy random number generated right-hand side 128 maximum iterations=2, nonzero initial guess 129 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 130 left preconditioning 131 not checking for convergence 132 PC Object: (mg_levels_2_) 1 MPI process 133 type: sor 134 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 135 linear system matrix, which is also used to construct the preconditioner: 136 Mat Object: 1 MPI process 137 type: seqaij 138 rows=169, cols=169 139 total: nonzeros=1369, allocated nonzeros=1369 140 total number of mallocs used during MatSetValues calls=0 141 not using I-node routines 142 Up solver (post-smoother) same as down solver (pre-smoother) 143 Down solver (pre-smoother) on level 3 ------------------------------- 144 KSP Object: (mg_levels_3_) 1 MPI process 145 type: chebyshev 146 Chebyshev polynomial of first kind 147 eigenvalue targets used: min 0.498868, max 1.09751 148 eigenvalues estimated via gmres: min 0.0267868, max 0.997736 149 eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 150 KSP Object: (mg_levels_3_esteig_) 1 MPI process 151 type: gmres 152 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 153 happy breakdown tolerance=1e-30 154 maximum iterations=10, initial guess is zero 155 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 156 left preconditioning 157 using PRECONDITIONED norm type for convergence test 158 estimating eigenvalues using a noisy random number generated right-hand side 159 maximum iterations=2, nonzero initial guess 160 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 161 left preconditioning 162 not checking for convergence 163 PC Object: (mg_levels_3_) 1 MPI process 164 type: sor 165 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 166 linear system matrix, which is also used to construct the preconditioner: 167 Mat Object: 1 MPI process 168 type: seqaij 169 rows=625, cols=625 170 total: nonzeros=3025, allocated nonzeros=3025 171 total number of mallocs used during MatSetValues calls=0 172 not using I-node routines 173 Up solver (post-smoother) same as down solver (pre-smoother) 174 linear system matrix, which is also used to construct the preconditioner: 175 Mat Object: 1 MPI process 176 type: seqaij 177 rows=625, cols=625 178 total: nonzeros=3025, allocated nonzeros=3025 179 total number of mallocs used during MatSetValues calls=0 180 not using I-node routines 181