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 maxstep=1.000000e+08, 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 using NONE norm type for convergence test 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 follows: 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 = precond matrix: 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 eigenvalue targets used: min 0.49992, max 1.09982 85 eigenvalues estimated via gmres: min 0.38164, max 0.999839 86 eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 87 KSP Object: (mg_levels_1_esteig_) 1 MPI process 88 type: gmres 89 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 90 happy breakdown tolerance 1e-30 91 maximum iterations=10, initial guess is zero 92 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 93 left preconditioning 94 using PRECONDITIONED norm type for convergence test 95 estimating eigenvalues using noisy right hand side 96 maximum iterations=2, nonzero initial guess 97 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 98 left preconditioning 99 using UNPRECONDITIONED norm type for convergence test 100 PC Object: (mg_levels_1_) 1 MPI process 101 type: sor 102 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 103 linear system matrix = precond matrix: 104 Mat Object: 1 MPI process 105 type: seqaij 106 rows=49, cols=49 107 total: nonzeros=361, allocated nonzeros=361 108 total number of mallocs used during MatSetValues calls=0 109 not using I-node routines 110 Up solver (post-smoother) same as down solver (pre-smoother) 111 Down solver (pre-smoother) on level 2 ------------------------------- 112 KSP Object: (mg_levels_2_) 1 MPI process 113 type: chebyshev 114 eigenvalue targets used: min 0.498238, max 1.09612 115 eigenvalues estimated via gmres: min 0.11325, max 0.996475 116 eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 117 KSP Object: (mg_levels_2_esteig_) 1 MPI process 118 type: gmres 119 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 120 happy breakdown tolerance 1e-30 121 maximum iterations=10, initial guess is zero 122 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 123 left preconditioning 124 using PRECONDITIONED norm type for convergence test 125 estimating eigenvalues using noisy right hand side 126 maximum iterations=2, nonzero initial guess 127 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 128 left preconditioning 129 using UNPRECONDITIONED norm type for convergence test 130 PC Object: (mg_levels_2_) 1 MPI process 131 type: sor 132 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 133 linear system matrix = precond matrix: 134 Mat Object: 1 MPI process 135 type: seqaij 136 rows=169, cols=169 137 total: nonzeros=1369, allocated nonzeros=1369 138 total number of mallocs used during MatSetValues calls=0 139 not using I-node routines 140 Up solver (post-smoother) same as down solver (pre-smoother) 141 Down solver (pre-smoother) on level 3 ------------------------------- 142 KSP Object: (mg_levels_3_) 1 MPI process 143 type: chebyshev 144 eigenvalue targets used: min 0.498868, max 1.09751 145 eigenvalues estimated via gmres: min 0.0267868, max 0.997736 146 eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 147 KSP Object: (mg_levels_3_esteig_) 1 MPI process 148 type: gmres 149 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 150 happy breakdown tolerance 1e-30 151 maximum iterations=10, initial guess is zero 152 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 153 left preconditioning 154 using PRECONDITIONED norm type for convergence test 155 estimating eigenvalues using noisy right hand side 156 maximum iterations=2, nonzero initial guess 157 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 158 left preconditioning 159 using UNPRECONDITIONED norm type for convergence test 160 PC Object: (mg_levels_3_) 1 MPI process 161 type: sor 162 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 163 linear system matrix = precond matrix: 164 Mat Object: 1 MPI process 165 type: seqaij 166 rows=625, cols=625 167 total: nonzeros=3025, allocated nonzeros=3025 168 total number of mallocs used during MatSetValues calls=0 169 not using I-node routines 170 Up solver (post-smoother) same as down solver (pre-smoother) 171 linear system matrix = precond matrix: 172 Mat Object: 1 MPI process 173 type: seqaij 174 rows=625, cols=625 175 total: nonzeros=3025, allocated nonzeros=3025 176 total number of mallocs used during MatSetValues calls=0 177 not using I-node routines 178