0 SNES Function norm 27982.5 0 SNES Function norm 27982.5 0 SNES Function norm 25715.7 1 SNES Function norm 11344.9 0 SNES Function norm 16515.3 1 SNES Function norm 1.04005e+06 2 SNES Function norm 308267. 3 SNES Function norm 91410.6 4 SNES Function norm 27106.5 5 SNES Function norm 8014.94 6 SNES Function norm 2370.78 7 SNES Function norm 696.385 8 SNES Function norm 179.424 9 SNES Function norm 31.6193 10 SNES Function norm 1.46351 11 SNES Function norm 0.00362442 12 SNES Function norm 2.14519e-08 0 SNES Function norm 53763.8 1 SNES Function norm 13036.4 0 SNES Function norm 23366.6 1 SNES Function norm 6924.35 L_2 Error: 1.51907 Nonlinear solve did not converge due to DIVERGED_INNER iterations 0 SNES Object: 1 MPI process type: fas type is MULTIPLICATIVE, levels=3, cycles=1 Not using Galerkin computed coarse grid function evaluation Coarse grid solver -- level 0 ------------------------------- SNES Object: (fas_coarse_) 1 MPI process type: newtonls maximum iterations=50, maximum function evaluations=10000 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 total number of linear solver iterations=12 total number of function evaluations=12 SNESLineSearch Object: (fas_coarse_) 1 MPI process type: basic maxlambda=1.000000e+00, minlambda=1.000000e-12 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 maximum iterations=40 KSP Object: (fas_coarse_) 1 MPI process type: gmres restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement happy breakdown tolerance=1e-30 maximum iterations=10000, initial guess is zero tolerances: relative=1e-05, absolute=1e-50, divergence=10000. left preconditioning using PRECONDITIONED norm type for convergence test PC Object: (fas_coarse_) 1 MPI process type: svd All singular values smaller than 1e-12 treated as zero Provided essential rank of the matrix 0 (all other eigenvalues are zeroed) linear system matrix, which is also used to construct the preconditioner: Mat Object: 1 MPI process type: seqaij rows=49, cols=49 total: nonzeros=529, allocated nonzeros=529 total number of mallocs used during MatSetValues calls=0 not using I-node routines Down solver (pre-smoother) on level 1 ------------------------------- SNES Object: (fas_levels_1_) 1 MPI process type: newtonls maximum iterations=1, maximum function evaluations=10000 tolerances: relative=0., absolute=0., solution=0. total number of linear solver iterations=1 total number of function evaluations=2 norm schedule FINALONLY SNESLineSearch Object: (fas_levels_1_) 1 MPI process type: bt interpolation: cubic alpha=1.000000e-04 maxlambda=1.000000e+00, minlambda=1.000000e-12 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 maximum iterations=40 KSP Object: (fas_levels_1_) 1 MPI process type: gmres restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement happy breakdown tolerance=1e-30 maximum iterations=10000, initial guess is zero tolerances: relative=1e-05, absolute=1e-50, divergence=10000. left preconditioning using PRECONDITIONED norm type for convergence test PC Object: (fas_levels_1_) 1 MPI process type: svd All singular values smaller than 1e-12 treated as zero Provided essential rank of the matrix 0 (all other eigenvalues are zeroed) linear system matrix, which is also used to construct the preconditioner: Mat Object: 1 MPI process type: seqaij rows=225, cols=225 total: nonzeros=3025, allocated nonzeros=3025 total number of mallocs used during MatSetValues calls=0 not using I-node routines Up solver (post-smoother) same as down solver (pre-smoother) Down solver (pre-smoother) on level 2 ------------------------------- SNES Object: (fas_levels_2_) 1 MPI process type: newtonls maximum iterations=1, maximum function evaluations=10000 tolerances: relative=0., absolute=0., solution=0. total number of linear solver iterations=1 total number of function evaluations=2 norm schedule FINALONLY SNESLineSearch Object: (fas_levels_2_) 1 MPI process type: bt interpolation: cubic alpha=1.000000e-04 maxlambda=1.000000e+00, minlambda=1.000000e-12 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 maximum iterations=40 KSP Object: (fas_levels_2_) 1 MPI process type: gmres restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement happy breakdown tolerance=1e-30 maximum iterations=10000, initial guess is zero tolerances: relative=1e-05, absolute=1e-50, divergence=10000. left preconditioning using PRECONDITIONED norm type for convergence test PC Object: (fas_levels_2_) 1 MPI process type: svd All singular values smaller than 1e-12 treated as zero Provided essential rank of the matrix 0 (all other eigenvalues are zeroed) linear system matrix, which is also used to construct the preconditioner: Mat Object: 1 MPI process type: seqaij rows=961, cols=961 total: nonzeros=14161, allocated nonzeros=14161 total number of mallocs used during MatSetValues calls=0 not using I-node routines Up solver (post-smoother) same as down solver (pre-smoother) maximum iterations=20, maximum function evaluations=30000 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 total number of function evaluations=1 norm schedule ALWAYS SNESLineSearch Object: 1 MPI process type: basic maxlambda=1.000000e+00, minlambda=1.000000e-12 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 maximum iterations=1