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