1c4762a1bSJed Brown 0 SNES Function norm 0.146402 2c4762a1bSJed Brown 1 SNES Function norm 0.00120796 3c4762a1bSJed Brown 2 SNES Function norm 8.07655e-08 4c4762a1bSJed Brown 3 SNES Function norm < 1.e-11 58cc725e6SPierre JolivetSNES Object: 1 MPI process 6c4762a1bSJed Brown type: newtonls 7c4762a1bSJed Brown maximum iterations=50, maximum function evaluations=10000 8c4762a1bSJed Brown tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 9c4762a1bSJed Brown total number of linear solver iterations=6 10c4762a1bSJed Brown total number of function evaluations=4 11c4762a1bSJed Brown norm schedule ALWAYS 12c4762a1bSJed Brown Jacobian is built using colored finite differences on a DMDA 138cc725e6SPierre Jolivet SNESLineSearch Object: 1 MPI process 14c4762a1bSJed Brown type: bt 15c4762a1bSJed Brown interpolation: cubic 16c4762a1bSJed Brown alpha=1.000000e-04 17a99ef635SJonas Heinzmann maxlambda=1.000000e+00, minlambda=1.000000e-12 18c4762a1bSJed Brown tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 19c4762a1bSJed Brown maximum iterations=40 208cc725e6SPierre Jolivet KSP Object: 1 MPI process 21c4762a1bSJed Brown type: fgmres 22f971d498SPierre Jolivet restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 23*143f2514SPierre Jolivet happy breakdown tolerance=1e-30 24c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 25c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 26c4762a1bSJed Brown right preconditioning 27c4762a1bSJed Brown using UNPRECONDITIONED norm type for convergence test 288cc725e6SPierre Jolivet PC Object: 1 MPI process 29c4762a1bSJed Brown type: mg 30c4762a1bSJed Brown type is FULL, levels=2 cycles=v 31c4762a1bSJed Brown Not using Galerkin computed coarse grid matrices 3263a3b9bcSJacob Faibussowitsch Coarse grid solver -- level 0 ------------------------------- 338cc725e6SPierre Jolivet KSP Object: (mg_coarse_) 1 MPI process 34c4762a1bSJed Brown type: preonly 35c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 36c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 37c4762a1bSJed Brown left preconditioning 388405740aSBarry Smith not checking for convergence 398cc725e6SPierre Jolivet PC Object: (mg_coarse_) 1 MPI process 40c4762a1bSJed Brown type: lu 41c4762a1bSJed Brown out-of-place factorization 42c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 43c4762a1bSJed Brown using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 44c4762a1bSJed Brown matrix ordering: nd 45c4762a1bSJed Brown factor fill ratio given 5., needed 1.875 46ecf3d421SBarry Smith Factored matrix: 4726cc229bSBarry Smith Mat Object: (mg_coarse_) 1 MPI process 48c4762a1bSJed Brown type: seqaij 49c4762a1bSJed Brown rows=16, cols=16 50c4762a1bSJed Brown package used to perform factorization: petsc 51c4762a1bSJed Brown total: nonzeros=120, allocated nonzeros=120 52c4762a1bSJed Brown using I-node routines: found 12 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=16, cols=16 57c4762a1bSJed Brown total: nonzeros=64, allocated nonzeros=64 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 KSP Object: (mg_levels_1_) 1 MPI process 62c4762a1bSJed Brown type: chebyshev 63f2edd1f0SMalachi Phillips Chebyshev polynomial of first kind 6473f7197eSJed Brown eigenvalue targets used: min 0.5, max 1.1 6573f7197eSJed Brown eigenvalues estimated via gmres: min 0.38553, max 0.999999 6673f7197eSJed Brown eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1] 678cc725e6SPierre Jolivet KSP Object: (mg_levels_1_esteig_) 1 MPI process 68c4762a1bSJed Brown type: gmres 69f971d498SPierre Jolivet restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 70*143f2514SPierre Jolivet happy breakdown tolerance=1e-30 71c4762a1bSJed Brown maximum iterations=10, initial guess is zero 72c4762a1bSJed Brown tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 73c4762a1bSJed Brown left preconditioning 74c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 75dd8e379bSPierre Jolivet estimating eigenvalues using a noisy random number generated right-hand side 76c4762a1bSJed Brown maximum iterations=2, nonzero initial guess 77c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 78c4762a1bSJed Brown left preconditioning 798405740aSBarry Smith not checking for convergence 808cc725e6SPierre Jolivet PC Object: (mg_levels_1_) 1 MPI process 81c4762a1bSJed Brown type: sor 82c4762a1bSJed Brown type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 83ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 848cc725e6SPierre Jolivet Mat Object: 1 MPI process 85c4762a1bSJed Brown type: seqaij 86c4762a1bSJed Brown rows=49, cols=49 87c4762a1bSJed Brown total: nonzeros=217, allocated nonzeros=217 88c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 89c4762a1bSJed Brown not using I-node routines 90c4762a1bSJed Brown Up solver (post-smoother) same as down solver (pre-smoother) 91ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 928cc725e6SPierre Jolivet Mat Object: 1 MPI process 93c4762a1bSJed Brown type: seqaij 94c4762a1bSJed Brown rows=49, cols=49 95c4762a1bSJed Brown total: nonzeros=217, allocated nonzeros=217 96c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 97c4762a1bSJed Brown not using I-node routines 98c4762a1bSJed BrownNumber of SNES iterations = 3 99