1*c4762a1bSJed Brown 0 SNES Function norm 0.146402 2*c4762a1bSJed Brown 1 SNES Function norm 0.00120796 3*c4762a1bSJed Brown 2 SNES Function norm 8.07655e-08 4*c4762a1bSJed Brown 3 SNES Function norm < 1.e-11 5*c4762a1bSJed BrownSNES Object: 1 MPI processes 6*c4762a1bSJed Brown type: newtonls 7*c4762a1bSJed Brown maximum iterations=50, maximum function evaluations=10000 8*c4762a1bSJed Brown tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 9*c4762a1bSJed Brown total number of linear solver iterations=6 10*c4762a1bSJed Brown total number of function evaluations=4 11*c4762a1bSJed Brown norm schedule ALWAYS 12*c4762a1bSJed Brown Jacobian is built using colored finite differences on a DMDA 13*c4762a1bSJed BrownSNESLineSearch Object: 1 MPI processes 14*c4762a1bSJed Brown type: bt 15*c4762a1bSJed Brown interpolation: cubic 16*c4762a1bSJed Brown alpha=1.000000e-04 17*c4762a1bSJed Brown maxstep=1.000000e+08, minlambda=1.000000e-12 18*c4762a1bSJed Brown tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 19*c4762a1bSJed Brown maximum iterations=40 20*c4762a1bSJed Brown KSP Object: 1 MPI processes 21*c4762a1bSJed Brown type: fgmres 22*c4762a1bSJed Brown restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 23*c4762a1bSJed Brown happy breakdown tolerance 1e-30 24*c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 25*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 26*c4762a1bSJed Brown right preconditioning 27*c4762a1bSJed Brown using UNPRECONDITIONED norm type for convergence test 28*c4762a1bSJed Brown PC Object: 1 MPI processes 29*c4762a1bSJed Brown type: mg 30*c4762a1bSJed Brown type is FULL, levels=2 cycles=v 31*c4762a1bSJed Brown Not using Galerkin computed coarse grid matrices 32*c4762a1bSJed Brown Coarse grid solver -- level ------------------------------- 33*c4762a1bSJed Brown KSP Object: (mg_coarse_) 1 MPI processes 34*c4762a1bSJed Brown type: preonly 35*c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 36*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 37*c4762a1bSJed Brown left preconditioning 38*c4762a1bSJed Brown using NONE norm type for convergence test 39*c4762a1bSJed Brown PC Object: (mg_coarse_) 1 MPI processes 40*c4762a1bSJed Brown type: lu 41*c4762a1bSJed Brown out-of-place factorization 42*c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 43*c4762a1bSJed Brown using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 44*c4762a1bSJed Brown matrix ordering: nd 45*c4762a1bSJed Brown factor fill ratio given 5., needed 1.875 46*c4762a1bSJed Brown Factored matrix follows: 47*c4762a1bSJed Brown Mat Object: 1 MPI processes 48*c4762a1bSJed Brown type: seqaij 49*c4762a1bSJed Brown rows=16, cols=16 50*c4762a1bSJed Brown package used to perform factorization: petsc 51*c4762a1bSJed Brown total: nonzeros=120, allocated nonzeros=120 52*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 53*c4762a1bSJed Brown using I-node routines: found 12 nodes, limit used is 5 54*c4762a1bSJed Brown linear system matrix = precond matrix: 55*c4762a1bSJed Brown Mat Object: 1 MPI processes 56*c4762a1bSJed Brown type: seqaij 57*c4762a1bSJed Brown rows=16, cols=16 58*c4762a1bSJed Brown total: nonzeros=64, allocated nonzeros=64 59*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 60*c4762a1bSJed Brown not using I-node routines 61*c4762a1bSJed Brown Down solver (pre-smoother) on level 1 ------------------------------- 62*c4762a1bSJed Brown KSP Object: (mg_levels_1_) 1 MPI processes 63*c4762a1bSJed Brown type: chebyshev 64*c4762a1bSJed Brown eigenvalue estimates used: min = 0.5, max = 1.1 65*c4762a1bSJed Brown eigenvalues estimate via gmres min 0.38553, max 0.999999 66*c4762a1bSJed Brown eigenvalues estimated using gmres with translations [0. 0.5; 0. 1.1] 67*c4762a1bSJed Brown KSP Object: (mg_levels_1_esteig_) 1 MPI processes 68*c4762a1bSJed Brown type: gmres 69*c4762a1bSJed Brown restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 70*c4762a1bSJed Brown happy breakdown tolerance 1e-30 71*c4762a1bSJed Brown maximum iterations=10, initial guess is zero 72*c4762a1bSJed Brown tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 73*c4762a1bSJed Brown left preconditioning 74*c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 75*c4762a1bSJed Brown estimating eigenvalues using noisy right hand side 76*c4762a1bSJed Brown maximum iterations=2, nonzero initial guess 77*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 78*c4762a1bSJed Brown left preconditioning 79*c4762a1bSJed Brown using NONE norm type for convergence test 80*c4762a1bSJed Brown PC Object: (mg_levels_1_) 1 MPI processes 81*c4762a1bSJed Brown type: sor 82*c4762a1bSJed Brown type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 83*c4762a1bSJed Brown linear system matrix = precond matrix: 84*c4762a1bSJed Brown Mat Object: 1 MPI processes 85*c4762a1bSJed Brown type: seqaij 86*c4762a1bSJed Brown rows=49, cols=49 87*c4762a1bSJed Brown total: nonzeros=217, allocated nonzeros=217 88*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 89*c4762a1bSJed Brown not using I-node routines 90*c4762a1bSJed Brown Up solver (post-smoother) same as down solver (pre-smoother) 91*c4762a1bSJed Brown linear system matrix = precond matrix: 92*c4762a1bSJed Brown Mat Object: 1 MPI processes 93*c4762a1bSJed Brown type: seqaij 94*c4762a1bSJed Brown rows=49, cols=49 95*c4762a1bSJed Brown total: nonzeros=217, allocated nonzeros=217 96*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 97*c4762a1bSJed Brown not using I-node routines 98*c4762a1bSJed BrownNumber of SNES iterations = 3 99