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 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: 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 using NONE norm type for convergence test 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 using NONE norm type for convergence test 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 follows: 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 = precond matrix: 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 = precond matrix: 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 eigenvalue targets used: min 0.128728, max 1.41601 97 eigenvalues estimated via gmres: min 0.220123, max 1.28728 98 eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1] 99 KSP Object: (mg_levels_1_esteig_) 2 MPI processes 100 type: gmres 101 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 102 happy breakdown tolerance 1e-30 103 maximum iterations=10, initial guess is zero 104 tolerances: relative=1e-12, absolute=1e-25, divergence=10000. 105 left preconditioning 106 using PRECONDITIONED norm type for convergence test 107 estimating eigenvalues using noisy right hand side 108 maximum iterations=2, nonzero initial guess 109 tolerances: relative=1e-05, absolute=1e-25, divergence=10000. 110 left preconditioning 111 using NONE norm type for convergence test 112 PC Object: (mg_levels_1_) 2 MPI processes 113 type: sor 114 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 115 linear system matrix = precond matrix: 116 Mat Object: 2 MPI processes 117 type: mpiaij 118 rows=49, cols=49 119 total: nonzeros=217, allocated nonzeros=217 120 total number of mallocs used during MatSetValues calls=0 121 Up solver (post-smoother) same as down solver (pre-smoother) 122 Down solver (pre-smoother) on level 2 ------------------------------- 123 KSP Object: (mg_levels_2_) 2 MPI processes 124 type: chebyshev 125 eigenvalue targets used: min 0.12637, max 1.39007 126 eigenvalues estimated via gmres: min 0.0725255, max 1.2637 127 eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1] 128 KSP Object: (mg_levels_2_esteig_) 2 MPI processes 129 type: gmres 130 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 131 happy breakdown tolerance 1e-30 132 maximum iterations=10, initial guess is zero 133 tolerances: relative=1e-12, absolute=1e-25, divergence=10000. 134 left preconditioning 135 using PRECONDITIONED norm type for convergence test 136 estimating eigenvalues using noisy right hand side 137 maximum iterations=2, nonzero initial guess 138 tolerances: relative=1e-05, absolute=1e-25, divergence=10000. 139 left preconditioning 140 using NONE norm type for convergence test 141 PC Object: (mg_levels_2_) 2 MPI processes 142 type: sor 143 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 144 linear system matrix = precond matrix: 145 Mat Object: 2 MPI processes 146 type: mpiaij 147 rows=169, cols=169 148 total: nonzeros=793, allocated nonzeros=793 149 total number of mallocs used during MatSetValues calls=0 150 Up solver (post-smoother) same as down solver (pre-smoother) 151 linear system matrix = precond matrix: 152 Mat Object: 2 MPI processes 153 type: mpiaij 154 rows=169, cols=169 155 total: nonzeros=793, allocated nonzeros=793 156 total number of mallocs used during MatSetValues calls=0 157