1c4762a1bSJed Brown 0 SNES Function norm 8.32828 2c4762a1bSJed Brown 0 SNES Function norm 8.32828 354fcfd0cSMatthew G. Knepley 1 SNES Function norm 6.223e-10 454fcfd0cSMatthew G. Knepley 0 SNES Function norm 4.482e-10 5c4762a1bSJed Brown 1 SNES Function norm < 1.e-11 6c4762a1bSJed Brown 0 SNES Function norm < 1.e-11 7c4762a1bSJed Brown 1 SNES Function norm < 1.e-11 8c4762a1bSJed Brown 0 SNES Function norm < 1.e-11 9c4762a1bSJed Brown 1 SNES Function norm < 1.e-11 1054fcfd0cSMatthew G. Knepley 0 SNES Function norm 5.875e-10 11c4762a1bSJed Brown 1 SNES Function norm < 1.e-11 12c4762a1bSJed Brown 1 SNES Function norm < 1.e-11 132d157150SStefano ZampiniL_2 Error: 0.00131109 14c4762a1bSJed BrownNonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 1 158cc725e6SPierre JolivetSNES Object: 1 MPI process 16c4762a1bSJed Brown type: fas 17c4762a1bSJed Brown type is MULTIPLICATIVE, levels=3, cycles=1 18c4762a1bSJed Brown Not using Galerkin computed coarse grid function evaluation 19c4762a1bSJed Brown Coarse grid solver -- level 0 ------------------------------- 208cc725e6SPierre Jolivet SNES Object: (fas_coarse_) 1 MPI process 21c4762a1bSJed Brown type: newtonls 22c4762a1bSJed Brown maximum iterations=50, maximum function evaluations=10000 23c4762a1bSJed Brown tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 24c4762a1bSJed Brown total number of linear solver iterations=1 25c4762a1bSJed Brown total number of function evaluations=1 262d157150SStefano Zampini norm schedule ALWAYS 278cc725e6SPierre Jolivet SNESLineSearch Object: (fas_coarse_) 1 MPI process 28c4762a1bSJed Brown type: basic 29a99ef635SJonas Heinzmann maxlambda=1.000000e+00, minlambda=1.000000e-12 30c4762a1bSJed Brown tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 31c4762a1bSJed Brown maximum iterations=40 328cc725e6SPierre Jolivet KSP Object: (fas_coarse_) 1 MPI process 33c4762a1bSJed Brown type: gmres 34f971d498SPierre Jolivet restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 35*143f2514SPierre Jolivet happy breakdown tolerance=1e-30 36c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 37c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 38c4762a1bSJed Brown left preconditioning 39c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 408cc725e6SPierre Jolivet PC Object: (fas_coarse_) 1 MPI process 41c4762a1bSJed Brown type: lu 42c4762a1bSJed Brown out-of-place factorization 43c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 44c4762a1bSJed Brown matrix ordering: nd 45c4762a1bSJed Brown factor fill ratio given 5., needed 1.39024 46ecf3d421SBarry Smith Factored matrix: 4726cc229bSBarry Smith Mat Object: (fas_coarse_) 1 MPI process 48c4762a1bSJed Brown type: seqaij 49c4762a1bSJed Brown rows=9, cols=9 50c4762a1bSJed Brown package used to perform factorization: petsc 51c4762a1bSJed Brown total: nonzeros=57, allocated nonzeros=57 52c4762a1bSJed Brown using I-node routines: found 7 nodes, limit used is 5 53ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 5426cc229bSBarry Smith Mat Object: 1 MPI process 55c4762a1bSJed Brown type: seqaij 56c4762a1bSJed Brown rows=9, cols=9 57c4762a1bSJed Brown total: nonzeros=41, allocated nonzeros=41 58c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 59c4762a1bSJed Brown not using I-node routines 60c4762a1bSJed Brown Down solver (pre-smoother) on level 1 ------------------------------- 618cc725e6SPierre Jolivet SNES Object: (fas_levels_1_) 1 MPI process 62c4762a1bSJed Brown type: newtonls 6377e5a1f9SBarry Smith maximum iterations=1, maximum function evaluations=10000 64c4762a1bSJed Brown tolerances: relative=0., absolute=0., solution=0. 65c4762a1bSJed Brown total number of linear solver iterations=15 66c4762a1bSJed Brown total number of function evaluations=2 67c4762a1bSJed Brown norm schedule FINALONLY 688cc725e6SPierre Jolivet SNESLineSearch Object: (fas_levels_1_) 1 MPI process 69c4762a1bSJed Brown type: basic 70a99ef635SJonas Heinzmann maxlambda=1.000000e+00, minlambda=1.000000e-12 71c4762a1bSJed Brown tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 72c4762a1bSJed Brown maximum iterations=40 738cc725e6SPierre Jolivet KSP Object: (fas_levels_1_) 1 MPI process 74c4762a1bSJed Brown type: gmres 75f971d498SPierre Jolivet restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 76*143f2514SPierre Jolivet happy breakdown tolerance=1e-30 77c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 78c4762a1bSJed Brown tolerances: relative=1e-10, absolute=1e-50, divergence=10000. 79c4762a1bSJed Brown left preconditioning 80c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 818cc725e6SPierre Jolivet PC Object: (fas_levels_1_) 1 MPI process 82c4762a1bSJed Brown type: ilu 83c4762a1bSJed Brown out-of-place factorization 84c4762a1bSJed Brown 0 levels of fill 85c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 86c4762a1bSJed Brown matrix ordering: natural 87c4762a1bSJed Brown factor fill ratio given 1., needed 1. 88ecf3d421SBarry Smith Factored matrix: 8926cc229bSBarry Smith Mat Object: (fas_levels_1_) 1 MPI process 90c4762a1bSJed Brown type: seqaij 91c4762a1bSJed Brown rows=49, cols=49 92c4762a1bSJed Brown package used to perform factorization: petsc 93c4762a1bSJed Brown total: nonzeros=289, allocated nonzeros=289 94c4762a1bSJed Brown not using I-node routines 95ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 9626cc229bSBarry Smith Mat Object: 1 MPI process 97c4762a1bSJed Brown type: seqaij 98c4762a1bSJed Brown rows=49, cols=49 99c4762a1bSJed Brown total: nonzeros=289, allocated nonzeros=289 100c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 101c4762a1bSJed Brown not using I-node routines 102c4762a1bSJed Brown Up solver (post-smoother) same as down solver (pre-smoother) 103c4762a1bSJed Brown Down solver (pre-smoother) on level 2 ------------------------------- 1048cc725e6SPierre Jolivet SNES Object: (fas_levels_2_) 1 MPI process 105c4762a1bSJed Brown type: newtonls 10677e5a1f9SBarry Smith maximum iterations=1, maximum function evaluations=10000 107c4762a1bSJed Brown tolerances: relative=0., absolute=0., solution=0. 10854fcfd0cSMatthew G. Knepley total number of linear solver iterations=27 109c4762a1bSJed Brown total number of function evaluations=2 110c4762a1bSJed Brown norm schedule FINALONLY 1118cc725e6SPierre Jolivet SNESLineSearch Object: (fas_levels_2_) 1 MPI process 112c4762a1bSJed Brown type: basic 113a99ef635SJonas Heinzmann maxlambda=1.000000e+00, minlambda=1.000000e-12 114c4762a1bSJed Brown tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 115c4762a1bSJed Brown maximum iterations=40 1168cc725e6SPierre Jolivet KSP Object: (fas_levels_2_) 1 MPI process 117c4762a1bSJed Brown type: gmres 118f971d498SPierre Jolivet restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 119*143f2514SPierre Jolivet happy breakdown tolerance=1e-30 120c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 121c4762a1bSJed Brown tolerances: relative=1e-10, absolute=1e-50, divergence=10000. 122c4762a1bSJed Brown left preconditioning 123c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 1248cc725e6SPierre Jolivet PC Object: (fas_levels_2_) 1 MPI process 125c4762a1bSJed Brown type: ilu 126c4762a1bSJed Brown out-of-place factorization 127c4762a1bSJed Brown 0 levels of fill 128c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 129c4762a1bSJed Brown matrix ordering: natural 130c4762a1bSJed Brown factor fill ratio given 1., needed 1. 131ecf3d421SBarry Smith Factored matrix: 13226cc229bSBarry Smith Mat Object: (fas_levels_2_) 1 MPI process 133c4762a1bSJed Brown type: seqaij 134c4762a1bSJed Brown rows=225, cols=225 135c4762a1bSJed Brown package used to perform factorization: petsc 136c4762a1bSJed Brown total: nonzeros=1457, allocated nonzeros=1457 137c4762a1bSJed Brown not using I-node routines 138ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 13926cc229bSBarry Smith Mat Object: 1 MPI process 140c4762a1bSJed Brown type: seqaij 141c4762a1bSJed Brown rows=225, cols=225 142c4762a1bSJed Brown total: nonzeros=1457, allocated nonzeros=1457 143c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 144c4762a1bSJed Brown not using I-node routines 145c4762a1bSJed Brown Up solver (post-smoother) same as down solver (pre-smoother) 146c4762a1bSJed Brown maximum iterations=10000, maximum function evaluations=30000 147c4762a1bSJed Brown tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 148c4762a1bSJed Brown total number of function evaluations=1 149c4762a1bSJed Brown norm schedule ALWAYS 150