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