1atol=1e-50, rtol=1e-08, stol=1e-08, maxit=50, maxf=10000 2 0 SNES Function norm 5.41468 3 0 KSP Residual norm 8.074499924421e-01 4 1 KSP Residual norm 1.581263746959e-01 5 2 KSP Residual norm 5.965136688585e-17 6 1 SNES Function norm 0.295258 7 0 KSP Residual norm 1.576599996438e-02 8 1 KSP Residual norm 5.004825340514e-03 9 2 KSP Residual norm 1.017575130448e-18 10 2 SNES Function norm 0.000450229 11 0 KSP Residual norm 2.805395382507e-05 12 1 KSP Residual norm 1.214493572741e-05 13 2 KSP Residual norm 3.059468828362e-21 14 3 SNES Function norm 1.38967e-09 15SNES Object: 1 MPI process 16 type: newtonls 17 maximum iterations=50, maximum function evaluations=10000 18 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 19 total number of linear solver iterations=6 20 total number of function evaluations=4 21 norm schedule ALWAYS 22 SNESLineSearch Object: 1 MPI process 23 type: bt 24 interpolation: cubic 25 alpha=1.000000e-04 26 maxlambda=1.000000e+00, minlambda=1.000000e-12 27 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 28 maximum iterations=40 29 KSP Object: 1 MPI process 30 type: gmres 31 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 32 happy breakdown tolerance=1e-30 33 maximum iterations=10000, initial guess is zero 34 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 35 left preconditioning 36 using PRECONDITIONED norm type for convergence test 37 PC Object: 1 MPI process 38 type: fieldsplit 39 FieldSplit with MULTIPLICATIVE composition: total splits = 2, blocksize = 5 40 Solver info for each split is in the following KSP objects: 41 Split number 0 Fields 1, 0 42 KSP Object: (fieldsplit_0_) 1 MPI process 43 type: preonly 44 maximum iterations=10000, initial guess is zero 45 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 46 left preconditioning 47 not checking for convergence 48 PC Object: (fieldsplit_0_) 1 MPI process 49 type: ilu 50 out-of-place factorization 51 0 levels of fill 52 tolerance for zero pivot 2.22045e-14 53 matrix ordering: natural 54 factor fill ratio given 1., needed 1. 55 Factored matrix: 56 Mat Object: (fieldsplit_0_) 1 MPI process 57 type: seqaij 58 rows=2, cols=2, bs=2 59 package used to perform factorization: petsc 60 total: nonzeros=3, allocated nonzeros=3 61 not using I-node routines 62 linear system matrix, which is also used to construct the preconditioner: 63 Mat Object: (fieldsplit_0_) 1 MPI process 64 type: seqaij 65 rows=2, cols=2, bs=2 66 total: nonzeros=3, allocated nonzeros=3 67 total number of mallocs used during MatSetValues calls=0 68 not using I-node routines 69 Split number 1 Fields 2, 3, 4 70 KSP Object: (fieldsplit_1_) 1 MPI process 71 type: preonly 72 maximum iterations=10000, initial guess is zero 73 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 74 left preconditioning 75 not checking for convergence 76 PC Object: (fieldsplit_1_) 1 MPI process 77 type: ilu 78 out-of-place factorization 79 0 levels of fill 80 tolerance for zero pivot 2.22045e-14 81 matrix ordering: natural 82 factor fill ratio given 1., needed 1. 83 Factored matrix: 84 Mat Object: (fieldsplit_1_) 1 MPI process 85 type: seqaij 86 rows=3, cols=3, bs=3 87 package used to perform factorization: petsc 88 total: nonzeros=6, allocated nonzeros=6 89 not using I-node routines 90 linear system matrix, which is also used to construct the preconditioner: 91 Mat Object: (fieldsplit_1_) 1 MPI process 92 type: seqaij 93 rows=3, cols=3, bs=3 variable blocks set 94 total: nonzeros=6, allocated nonzeros=6 95 total number of mallocs used during MatSetValues calls=0 96 not using I-node routines 97 linear system matrix, which is also used to construct the preconditioner: 98 Mat Object: 1 MPI process 99 type: seqaij 100 rows=5, cols=5, bs=5 variable blocks set 101 total: nonzeros=11, allocated nonzeros=15 102 total number of mallocs used during MatSetValues calls=0 103 not using I-node routines 104number of SNES iterations = 3 105 106Norm of error 1.49752e-10, Iterations 3 107