1 0 SNES Function norm 0.146402 2 1 SNES Function norm 0.00119044 3 2 SNES Function norm 7.62153e-07 4SNES Object: 1 MPI process 5 type: newtonls 6 maximum iterations=50, maximum function evaluations=10000 7 tolerances: relative=1e-05, absolute=1e-25, solution=1e-05 8 total number of linear solver iterations=5 9 total number of function evaluations=3 10 norm schedule ALWAYS 11 Jacobian is built using colored finite differences on a DMDA 12 SNESLineSearch Object: 1 MPI process 13 type: bt 14 interpolation: cubic 15 alpha=1.000000e-04 16 maxlambda=1.000000e+00, minlambda=1.000000e-12 17 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 18 maximum iterations=40 19 KSP Object: 1 MPI process 20 type: fgmres 21 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 22 happy breakdown tolerance 1e-30 23 maximum iterations=10000, initial guess is zero 24 tolerances: relative=1e-05, absolute=1e-25, divergence=10000. 25 right preconditioning 26 using UNPRECONDITIONED norm type for convergence test 27 PC Object: 1 MPI process 28 type: mg 29 type is FULL, levels=2 cycles=v 30 Not using Galerkin computed coarse grid matrices 31 Coarse grid solver -- level 0 ------------------------------- 32 KSP Object: (mg_coarse_) 1 MPI process 33 type: preonly 34 maximum iterations=10000, initial guess is zero 35 tolerances: relative=1e-05, absolute=1e-25, divergence=10000. 36 left preconditioning 37 using NONE norm type for convergence test 38 PC Object: (mg_coarse_) 1 MPI process 39 type: lu 40 out-of-place factorization 41 tolerance for zero pivot 1.19209e-05 42 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 43 matrix ordering: nd 44 factor fill ratio given 5., needed 1.875 45 Factored matrix follows: 46 Mat Object: (mg_coarse_) 1 MPI process 47 type: seqaij 48 rows=16, cols=16 49 package used to perform factorization: petsc 50 total: nonzeros=120, allocated nonzeros=120 51 using I-node routines: found 12 nodes, limit used is 5 52 linear system matrix = precond matrix: 53 Mat Object: 1 MPI process 54 type: seqaij 55 rows=16, cols=16 56 total: nonzeros=64, allocated nonzeros=64 57 total number of mallocs used during MatSetValues calls=0 58 not using I-node routines 59 Down solver (pre-smoother) on level 1 ------------------------------- 60 KSP Object: (mg_levels_1_) 1 MPI process 61 type: chebyshev 62 Chebyshev polynomial of first kind 63 eigenvalue targets used: min 0.4938, max 1.08636 64 eigenvalues estimated via gmres: min 0.385395, max 0.9876 65 eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 66 KSP Object: (mg_levels_1_esteig_) 1 MPI process 67 type: gmres 68 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 69 happy breakdown tolerance 1e-30 70 maximum iterations=10, initial guess is zero 71 tolerances: relative=1e-12, absolute=1e-25, divergence=10000. 72 left preconditioning 73 using PRECONDITIONED norm type for convergence test 74 estimating eigenvalues using a noisy random number generated right-hand side 75 maximum iterations=2, nonzero initial guess 76 tolerances: relative=1e-05, absolute=1e-25, divergence=10000. 77 left preconditioning 78 using NONE norm type for convergence test 79 PC Object: (mg_levels_1_) 1 MPI process 80 type: sor 81 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 82 linear system matrix = precond matrix: 83 Mat Object: 1 MPI process 84 type: seqaij 85 rows=49, cols=49 86 total: nonzeros=217, allocated nonzeros=217 87 total number of mallocs used during MatSetValues calls=0 88 not using I-node routines 89 Up solver (post-smoother) same as down solver (pre-smoother) 90 linear system matrix = precond matrix: 91 Mat Object: 1 MPI process 92 type: seqaij 93 rows=49, cols=49 94 total: nonzeros=217, allocated nonzeros=217 95 total number of mallocs used during MatSetValues calls=0 96 not using I-node routines 97Number of SNES iterations = 2 98