0 SNES Function norm 95.2794 0 SNES Function norm 95.2794 1 SNES Function norm 27.7545 0 SNES Function norm 7.72252 1 SNES Function norm 1.53615 2 SNES Function norm 0.109054 3 SNES Function norm 0.000651896 4 SNES Function norm 2.36055e-08 0 SNES Function norm 27.9148 1 SNES Function norm 7.84699 1 SNES Function norm 7.84699 0 SNES Function norm 7.84699 1 SNES Function norm 1.64247 0 SNES Function norm 0.168478 1 SNES Function norm 0.00165933 2 SNES Function norm 1.62594e-07 3 SNES Function norm < 1.e-11 0 SNES Function norm 1.69667 1 SNES Function norm 0.163849 2 SNES Function norm 0.163849 0 SNES Function norm 0.163849 1 SNES Function norm 0.00249421 0 SNES Function norm 0.000417676 1 SNES Function norm 1.00749e-08 2 SNES Function norm < 1.e-11 0 SNES Function norm 0.00265254 1 SNES Function norm 5.66326e-07 3 SNES Function norm 5.66326e-07 L_2 Error: 0.0198799 Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 3 SNES Object: 1 MPI process type: fas type is MULTIPLICATIVE, levels=2, 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=2 total number of function evaluations=2 norm schedule ALWAYS 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-10, 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=1, cols=1 total: nonzeros=1, allocated nonzeros=1 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-10, 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=9, cols=9 total: nonzeros=41, allocated nonzeros=41 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=10000, maximum function evaluations=30000 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 total number of function evaluations=1 norm schedule ALWAYS