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