1SNES Object: 1 MPI process 2 type: python 3 Python: ex1.py:MySNES 4 My context: C pointer 5 maximum iterations=50, maximum function evaluations=10000 6 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 7 total number of linear solver iterations=8 8 total number of function evaluations=5 9 norm schedule ALWAYS 10 SNESLineSearch Object: 1 MPI process 11 type: basic 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=1 15 KSP Object: 1 MPI process 16 type: gmres 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 left preconditioning 22 using PRECONDITIONED norm type for convergence test 23 PC Object: 1 MPI process 24 type: ilu 25 out-of-place factorization 26 0 levels of fill 27 tolerance for zero pivot 2.22045e-14 28 matrix ordering: natural 29 factor fill ratio given 1., needed 1. 30 Factored matrix follows: 31 Mat Object: 1 MPI process 32 type: seqaij 33 rows=16, cols=16 34 package used to perform factorization: petsc 35 total: nonzeros=32, allocated nonzeros=32 36 not using I-node routines 37 linear system matrix = precond matrix: 38 Mat Object: 1 MPI process 39 type: seqaij 40 rows=16, cols=16 41 total: nonzeros=32, allocated nonzeros=80 42 total number of mallocs used during MatSetValues calls=0 43 not using I-node routines 44Number of SNES iterations = 4 45