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 processes 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 34SNESLineSearch Object: 1 MPI processes 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 processes 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 processes 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 ------------------------------- 54 KSP Object: (mg_coarse_) 1 MPI processes 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 processes 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: 1 MPI processes 69 type: seqaij 70 rows=16, cols=16 71 package used to perform factorization: petsc 72 total: nonzeros=142, allocated nonzeros=142 73 total number of mallocs used during MatSetValues calls=0 74 using I-node routines: found 11 nodes, limit used is 5 75 linear system matrix = precond matrix: 76 Mat Object: 1 MPI processes 77 type: seqaij 78 rows=16, cols=16 79 total: nonzeros=100, allocated nonzeros=100 80 total number of mallocs used during MatSetValues calls=0 81 not using I-node routines 82 Down solver (pre-smoother) on level 1 ------------------------------- 83 KSP Object: (mg_levels_1_) 1 MPI processes 84 type: chebyshev 85 eigenvalue estimates used: min = 0.49992, max = 1.09982 86 eigenvalues estimate via gmres min 0.38164, max 0.999839 87 eigenvalues estimated using gmres with translations [0. 0.5; 0. 1.1] 88 KSP Object: (mg_levels_1_esteig_) 1 MPI processes 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 noisy right hand side 97 maximum iterations=2, nonzero initial guess 98 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 99 left preconditioning 100 using UNPRECONDITIONED norm type for convergence test 101 PC Object: (mg_levels_1_) 1 MPI processes 102 type: sor 103 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 104 linear system matrix = precond matrix: 105 Mat Object: 1 MPI processes 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 processes 114 type: chebyshev 115 eigenvalue estimates used: min = 0.498238, max = 1.09612 116 eigenvalues estimate via gmres min 0.11325, max 0.996475 117 eigenvalues estimated using gmres with translations [0. 0.5; 0. 1.1] 118 KSP Object: (mg_levels_2_esteig_) 1 MPI processes 119 type: gmres 120 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 121 happy breakdown tolerance 1e-30 122 maximum iterations=10, initial guess is zero 123 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 124 left preconditioning 125 using PRECONDITIONED norm type for convergence test 126 estimating eigenvalues using noisy right hand side 127 maximum iterations=2, nonzero initial guess 128 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 129 left preconditioning 130 using UNPRECONDITIONED norm type for convergence test 131 PC Object: (mg_levels_2_) 1 MPI processes 132 type: sor 133 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 134 linear system matrix = precond matrix: 135 Mat Object: 1 MPI processes 136 type: seqaij 137 rows=169, cols=169 138 total: nonzeros=1369, allocated nonzeros=1369 139 total number of mallocs used during MatSetValues calls=0 140 not using I-node routines 141 Up solver (post-smoother) same as down solver (pre-smoother) 142 Down solver (pre-smoother) on level 3 ------------------------------- 143 KSP Object: (mg_levels_3_) 1 MPI processes 144 type: chebyshev 145 eigenvalue estimates used: min = 0.498868, max = 1.09751 146 eigenvalues estimate via gmres min 0.0267868, max 0.997736 147 eigenvalues estimated using gmres with translations [0. 0.5; 0. 1.1] 148 KSP Object: (mg_levels_3_esteig_) 1 MPI processes 149 type: gmres 150 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 151 happy breakdown tolerance 1e-30 152 maximum iterations=10, initial guess is zero 153 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 154 left preconditioning 155 using PRECONDITIONED norm type for convergence test 156 estimating eigenvalues using noisy right hand side 157 maximum iterations=2, nonzero initial guess 158 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 159 left preconditioning 160 using UNPRECONDITIONED norm type for convergence test 161 PC Object: (mg_levels_3_) 1 MPI processes 162 type: sor 163 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 164 linear system matrix = precond matrix: 165 Mat Object: 1 MPI processes 166 type: seqaij 167 rows=625, cols=625 168 total: nonzeros=3025, allocated nonzeros=3025 169 total number of mallocs used during MatSetValues calls=0 170 not using I-node routines 171 Up solver (post-smoother) same as down solver (pre-smoother) 172 linear system matrix = precond matrix: 173 Mat Object: 1 MPI processes 174 type: seqaij 175 rows=625, cols=625 176 total: nonzeros=3025, allocated nonzeros=3025 177 total number of mallocs used during MatSetValues calls=0 178 not using I-node routines 179