1 0 SNES Function norm 27982.5 2 0 SNES Function norm 27982.5 3 0 SNES Function norm 25715.7 4 1 SNES Function norm 11344.9 5 0 SNES Function norm 16515.3 6 1 SNES Function norm 1.04005e+06 7 2 SNES Function norm 308267. 8 3 SNES Function norm 91410.6 9 4 SNES Function norm 27106.5 10 5 SNES Function norm 8014.94 11 6 SNES Function norm 2370.78 12 7 SNES Function norm 696.385 13 8 SNES Function norm 179.424 14 9 SNES Function norm 31.6193 15 10 SNES Function norm 1.46351 16 11 SNES Function norm 0.00362442 17 12 SNES Function norm 2.14519e-08 18 0 SNES Function norm 53763.8 19 1 SNES Function norm 13036.4 20 0 SNES Function norm 23366.6 21 1 SNES Function norm 6924.35 22L_2 Error: 1.51907 23Nonlinear solve did not converge due to DIVERGED_INNER iterations 0 24SNES Object: 1 MPI process 25 type: fas 26 type is MULTIPLICATIVE, levels=3, cycles=1 27 Not using Galerkin computed coarse grid function evaluation 28 Coarse grid solver -- level 0 ------------------------------- 29 SNES Object: (fas_coarse_) 1 MPI process 30 type: newtonls 31 maximum iterations=50, maximum function evaluations=10000 32 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 33 total number of linear solver iterations=12 34 total number of function evaluations=12 35 SNESLineSearch Object: (fas_coarse_) 1 MPI process 36 type: basic 37 maxlambda=1.000000e+00, minlambda=1.000000e-12 38 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 39 maximum iterations=40 40 KSP Object: (fas_coarse_) 1 MPI process 41 type: gmres 42 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 43 happy breakdown tolerance=1e-30 44 maximum iterations=10000, initial guess is zero 45 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 46 left preconditioning 47 using PRECONDITIONED norm type for convergence test 48 PC Object: (fas_coarse_) 1 MPI process 49 type: svd 50 All singular values smaller than 1e-12 treated as zero 51 Provided essential rank of the matrix 0 (all other eigenvalues are zeroed) 52 linear system matrix, which is also used to construct the preconditioner: 53 Mat Object: 1 MPI process 54 type: seqaij 55 rows=49, cols=49 56 total: nonzeros=529, allocated nonzeros=529 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 process 61 type: newtonls 62 maximum iterations=1, maximum function evaluations=10000 63 tolerances: relative=0., absolute=0., solution=0. 64 total number of linear solver iterations=1 65 total number of function evaluations=2 66 norm schedule FINALONLY 67 SNESLineSearch Object: (fas_levels_1_) 1 MPI process 68 type: bt 69 interpolation: cubic 70 alpha=1.000000e-04 71 maxlambda=1.000000e+00, minlambda=1.000000e-12 72 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 73 maximum iterations=40 74 KSP Object: (fas_levels_1_) 1 MPI process 75 type: gmres 76 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 77 happy breakdown tolerance=1e-30 78 maximum iterations=10000, initial guess is zero 79 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 80 left preconditioning 81 using PRECONDITIONED norm type for convergence test 82 PC Object: (fas_levels_1_) 1 MPI process 83 type: svd 84 All singular values smaller than 1e-12 treated as zero 85 Provided essential rank of the matrix 0 (all other eigenvalues are zeroed) 86 linear system matrix, which is also used to construct the preconditioner: 87 Mat Object: 1 MPI process 88 type: seqaij 89 rows=225, cols=225 90 total: nonzeros=3025, allocated nonzeros=3025 91 total number of mallocs used during MatSetValues calls=0 92 not using I-node routines 93 Up solver (post-smoother) same as down solver (pre-smoother) 94 Down solver (pre-smoother) on level 2 ------------------------------- 95 SNES Object: (fas_levels_2_) 1 MPI process 96 type: newtonls 97 maximum iterations=1, maximum function evaluations=10000 98 tolerances: relative=0., absolute=0., solution=0. 99 total number of linear solver iterations=1 100 total number of function evaluations=2 101 norm schedule FINALONLY 102 SNESLineSearch Object: (fas_levels_2_) 1 MPI process 103 type: bt 104 interpolation: cubic 105 alpha=1.000000e-04 106 maxlambda=1.000000e+00, minlambda=1.000000e-12 107 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 108 maximum iterations=40 109 KSP Object: (fas_levels_2_) 1 MPI process 110 type: gmres 111 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 112 happy breakdown tolerance=1e-30 113 maximum iterations=10000, initial guess is zero 114 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 115 left preconditioning 116 using PRECONDITIONED norm type for convergence test 117 PC Object: (fas_levels_2_) 1 MPI process 118 type: svd 119 All singular values smaller than 1e-12 treated as zero 120 Provided essential rank of the matrix 0 (all other eigenvalues are zeroed) 121 linear system matrix, which is also used to construct the preconditioner: 122 Mat Object: 1 MPI process 123 type: seqaij 124 rows=961, cols=961 125 total: nonzeros=14161, allocated nonzeros=14161 126 total number of mallocs used during MatSetValues calls=0 127 not using I-node routines 128 Up solver (post-smoother) same as down solver (pre-smoother) 129 maximum iterations=20, maximum function evaluations=30000 130 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 131 total number of function evaluations=1 132 norm schedule ALWAYS 133 SNESLineSearch Object: 1 MPI process 134 type: basic 135 maxlambda=1.000000e+00, minlambda=1.000000e-12 136 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 137 maximum iterations=1 138