1 0 SNES Function norm 8.32828 2 0 SNES Function norm 8.32828 3 1 SNES Function norm 6.223e-10 4 0 SNES Function norm 4.482e-10 5 1 SNES Function norm < 1.e-11 6 0 SNES Function norm < 1.e-11 7 1 SNES Function norm < 1.e-11 8 0 SNES Function norm < 1.e-11 9 1 SNES Function norm < 1.e-11 10 0 SNES Function norm 5.875e-10 11 1 SNES Function norm < 1.e-11 12 1 SNES Function norm < 1.e-11 13L_2 Error: 0.00131109 14Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 1 15SNES Object: 1 MPI process 16 type: fas 17 type is MULTIPLICATIVE, levels=3, cycles=1 18 Not using Galerkin computed coarse grid function evaluation 19 Coarse grid solver -- level 0 ------------------------------- 20 SNES Object: (fas_coarse_) 1 MPI process 21 type: newtonls 22 maximum iterations=50, maximum function evaluations=10000 23 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 24 total number of linear solver iterations=1 25 total number of function evaluations=1 26 norm schedule ALWAYS 27 SNESLineSearch Object: (fas_coarse_) 1 MPI process 28 type: basic 29 maxlambda=1.000000e+00, minlambda=1.000000e-12 30 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 31 maximum iterations=40 32 KSP Object: (fas_coarse_) 1 MPI process 33 type: gmres 34 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 35 happy breakdown tolerance=1e-30 36 maximum iterations=10000, initial guess is zero 37 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 38 left preconditioning 39 using PRECONDITIONED norm type for convergence test 40 PC Object: (fas_coarse_) 1 MPI process 41 type: lu 42 out-of-place factorization 43 tolerance for zero pivot 2.22045e-14 44 matrix ordering: nd 45 factor fill ratio given 5., needed 1.39024 46 Factored matrix: 47 Mat Object: (fas_coarse_) 1 MPI process 48 type: seqaij 49 rows=9, cols=9 50 package used to perform factorization: petsc 51 total: nonzeros=57, allocated nonzeros=57 52 using I-node routines: found 7 nodes, limit used is 5 53 linear system matrix, which is also used to construct the preconditioner: 54 Mat Object: 1 MPI process 55 type: seqaij 56 rows=9, cols=9 57 total: nonzeros=41, allocated nonzeros=41 58 total number of mallocs used during MatSetValues calls=0 59 not using I-node routines 60 Down solver (pre-smoother) on level 1 ------------------------------- 61 SNES Object: (fas_levels_1_) 1 MPI process 62 type: newtonls 63 maximum iterations=1, maximum function evaluations=10000 64 tolerances: relative=0., absolute=0., solution=0. 65 total number of linear solver iterations=15 66 total number of function evaluations=2 67 norm schedule FINALONLY 68 SNESLineSearch Object: (fas_levels_1_) 1 MPI process 69 type: basic 70 maxlambda=1.000000e+00, minlambda=1.000000e-12 71 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 72 maximum iterations=40 73 KSP Object: (fas_levels_1_) 1 MPI process 74 type: gmres 75 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 76 happy breakdown tolerance=1e-30 77 maximum iterations=10000, initial guess is zero 78 tolerances: relative=1e-10, absolute=1e-50, divergence=10000. 79 left preconditioning 80 using PRECONDITIONED norm type for convergence test 81 PC Object: (fas_levels_1_) 1 MPI process 82 type: ilu 83 out-of-place factorization 84 0 levels of fill 85 tolerance for zero pivot 2.22045e-14 86 matrix ordering: natural 87 factor fill ratio given 1., needed 1. 88 Factored matrix: 89 Mat Object: (fas_levels_1_) 1 MPI process 90 type: seqaij 91 rows=49, cols=49 92 package used to perform factorization: petsc 93 total: nonzeros=289, allocated nonzeros=289 94 not using I-node routines 95 linear system matrix, which is also used to construct the preconditioner: 96 Mat Object: 1 MPI process 97 type: seqaij 98 rows=49, cols=49 99 total: nonzeros=289, allocated nonzeros=289 100 total number of mallocs used during MatSetValues calls=0 101 not using I-node routines 102 Up solver (post-smoother) same as down solver (pre-smoother) 103 Down solver (pre-smoother) on level 2 ------------------------------- 104 SNES Object: (fas_levels_2_) 1 MPI process 105 type: newtonls 106 maximum iterations=1, maximum function evaluations=10000 107 tolerances: relative=0., absolute=0., solution=0. 108 total number of linear solver iterations=27 109 total number of function evaluations=2 110 norm schedule FINALONLY 111 SNESLineSearch Object: (fas_levels_2_) 1 MPI process 112 type: basic 113 maxlambda=1.000000e+00, minlambda=1.000000e-12 114 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 115 maximum iterations=40 116 KSP Object: (fas_levels_2_) 1 MPI process 117 type: gmres 118 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 119 happy breakdown tolerance=1e-30 120 maximum iterations=10000, initial guess is zero 121 tolerances: relative=1e-10, absolute=1e-50, divergence=10000. 122 left preconditioning 123 using PRECONDITIONED norm type for convergence test 124 PC Object: (fas_levels_2_) 1 MPI process 125 type: ilu 126 out-of-place factorization 127 0 levels of fill 128 tolerance for zero pivot 2.22045e-14 129 matrix ordering: natural 130 factor fill ratio given 1., needed 1. 131 Factored matrix: 132 Mat Object: (fas_levels_2_) 1 MPI process 133 type: seqaij 134 rows=225, cols=225 135 package used to perform factorization: petsc 136 total: nonzeros=1457, allocated nonzeros=1457 137 not using I-node routines 138 linear system matrix, which is also used to construct the preconditioner: 139 Mat Object: 1 MPI process 140 type: seqaij 141 rows=225, cols=225 142 total: nonzeros=1457, allocated nonzeros=1457 143 total number of mallocs used during MatSetValues calls=0 144 not using I-node routines 145 Up solver (post-smoother) same as down solver (pre-smoother) 146 maximum iterations=10000, maximum function evaluations=30000 147 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 148 total number of function evaluations=1 149 norm schedule ALWAYS 150