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