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