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