1SNES Object: 1 MPI process 2 type: newtonls 3 maximum iterations=50, maximum function evaluations=10000 4 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 5 total number of linear solver iterations=24 6 total number of function evaluations=7 7 norm schedule ALWAYS 8 SNESLineSearch Object: 1 MPI process 9 type: bt 10 interpolation: cubic 11 alpha=1.000000e-04 12 maxstep=1.000000e+08, minlambda=1.000000e-12 13 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 14 maximum iterations=40 15 KSP Object: 1 MPI process 16 type: fgmres 17 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 18 happy breakdown tolerance 1e-30 19 maximum iterations=10000, initial guess is zero 20 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 21 right preconditioning 22 using UNPRECONDITIONED norm type for convergence test 23 PC Object: 1 MPI process 24 type: mg 25 type is MULTIPLICATIVE, levels=3 cycles=v 26 Cycles per PCApply=1 27 Using Galerkin computed coarse grid matrices for pmat 28 Coarse grid solver -- level 0 ------------------------------- 29 KSP Object: (mg_coarse_) 1 MPI process 30 type: preonly 31 maximum iterations=10000, initial guess is zero 32 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 33 left preconditioning 34 using NONE norm type for convergence test 35 PC Object: (mg_coarse_) 1 MPI process 36 type: lu 37 out-of-place factorization 38 tolerance for zero pivot 2.22045e-14 39 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 40 matrix ordering: nd 41 factor fill ratio given 5., needed 1.59172 42 Factored matrix follows: 43 Mat Object: (mg_coarse_) 1 MPI process 44 type: seqaij 45 rows=25, cols=25 46 package used to perform factorization: petsc 47 total: nonzeros=269, allocated nonzeros=269 48 using I-node routines: found 17 nodes, limit used is 5 49 linear system matrix = precond matrix: 50 Mat Object: 1 MPI process 51 type: seqaij 52 rows=25, cols=25 53 total: nonzeros=169, allocated nonzeros=169 54 total number of mallocs used during MatSetValues calls=0 55 not using I-node routines 56 Down solver (pre-smoother) on level 1 ------------------------------- 57 KSP Object: (mg_levels_1_) 1 MPI process 58 type: chebyshev 59 Chebyshev polynomial of first kind 60 eigenvalue targets used: min 0.0996438, max 1.09608 61 eigenvalues estimated via gmres: min 0.139653, max 0.996438 62 eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1] 63 KSP Object: (mg_levels_1_esteig_) 1 MPI process 64 type: gmres 65 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 66 happy breakdown tolerance 1e-30 67 maximum iterations=10, initial guess is zero 68 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 69 left preconditioning 70 using PRECONDITIONED norm type for convergence test 71 estimating eigenvalues using noisy right hand side 72 maximum iterations=2, nonzero initial guess 73 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 74 left preconditioning 75 using NONE norm type for convergence test 76 PC Object: (mg_levels_1_) 1 MPI process 77 type: sor 78 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 79 linear system matrix = precond matrix: 80 Mat Object: 1 MPI process 81 type: seqaij 82 rows=81, cols=81 83 total: nonzeros=625, allocated nonzeros=625 84 total number of mallocs used during MatSetValues calls=0 85 not using I-node routines 86 Up solver (post-smoother) same as down solver (pre-smoother) 87 Down solver (pre-smoother) on level 2 ------------------------------- 88 KSP Object: (mg_levels_2_) 1 MPI process 89 type: chebyshev 90 Chebyshev polynomial of first kind 91 eigenvalue targets used: min 0.0990486, max 1.08953 92 eigenvalues estimated via gmres: min 0.0626846, max 0.990486 93 eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1] 94 KSP Object: (mg_levels_2_esteig_) 1 MPI process 95 type: gmres 96 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 97 happy breakdown tolerance 1e-30 98 maximum iterations=10, initial guess is zero 99 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 100 left preconditioning 101 using PRECONDITIONED norm type for convergence test 102 estimating eigenvalues using noisy right hand side 103 maximum iterations=2, nonzero initial guess 104 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 105 left preconditioning 106 using NONE norm type for convergence test 107 PC Object: (mg_levels_2_) 1 MPI process 108 type: sor 109 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 110 linear system matrix = precond matrix: 111 Mat Object: 1 MPI process 112 type: seqaij 113 rows=289, cols=289 114 total: nonzeros=1377, allocated nonzeros=1377 115 total number of mallocs used during MatSetValues calls=0 116 not using I-node routines 117 Up solver (post-smoother) same as down solver (pre-smoother) 118 linear system matrix = precond matrix: 119 Mat Object: 1 MPI process 120 type: seqaij 121 rows=289, cols=289 122 total: nonzeros=1377, allocated nonzeros=1377 123 total number of mallocs used during MatSetValues calls=0 124 not using I-node routines 125Number of SNES iterations = 6 126Number of Linear iterations = 24 127Average Linear its / SNES = 4.000000e+00 128