0 SNES Function norm 8.32828 0 SNES Function norm 8.32828 1 SNES Function norm 6.223e-10 0 SNES Function norm 4.482e-10 1 SNES Function norm < 1.e-11 0 SNES Function norm < 1.e-11 1 SNES Function norm < 1.e-11 0 SNES Function norm < 1.e-11 1 SNES Function norm < 1.e-11 0 SNES Function norm 5.875e-10 1 SNES Function norm < 1.e-11 1 SNES Function norm < 1.e-11 L_2 Error: 0.00131109 Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 1 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=1 total number of function evaluations=1 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-05, absolute=1e-50, divergence=10000. left preconditioning using PRECONDITIONED norm type for convergence test PC Object: (fas_coarse_) 1 MPI process type: lu out-of-place factorization tolerance for zero pivot 2.22045e-14 matrix ordering: nd factor fill ratio given 5., needed 1.39024 Factored matrix: Mat Object: (fas_coarse_) 1 MPI process type: seqaij rows=9, cols=9 package used to perform factorization: petsc total: nonzeros=57, allocated nonzeros=57 using I-node routines: found 7 nodes, limit used is 5 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 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=15 total number of function evaluations=2 norm schedule FINALONLY SNESLineSearch Object: (fas_levels_1_) 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_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: ilu out-of-place factorization 0 levels of fill tolerance for zero pivot 2.22045e-14 matrix ordering: natural factor fill ratio given 1., needed 1. Factored matrix: Mat Object: (fas_levels_1_) 1 MPI process type: seqaij rows=49, cols=49 package used to perform factorization: petsc total: nonzeros=289, allocated nonzeros=289 not using I-node routines linear system matrix, which is also used to construct the preconditioner: Mat Object: 1 MPI process type: seqaij rows=49, cols=49 total: nonzeros=289, allocated nonzeros=289 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=27 total number of function evaluations=2 norm schedule FINALONLY SNESLineSearch Object: (fas_levels_2_) 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_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-10, absolute=1e-50, divergence=10000. left preconditioning using PRECONDITIONED norm type for convergence test PC Object: (fas_levels_2_) 1 MPI process type: ilu out-of-place factorization 0 levels of fill tolerance for zero pivot 2.22045e-14 matrix ordering: natural factor fill ratio given 1., needed 1. Factored matrix: Mat Object: (fas_levels_2_) 1 MPI process type: seqaij rows=225, cols=225 package used to perform factorization: petsc total: nonzeros=1457, allocated nonzeros=1457 not using I-node routines linear system matrix, which is also used to construct the preconditioner: Mat Object: 1 MPI process type: seqaij rows=225, cols=225 total: nonzeros=1457, allocated nonzeros=1457 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