1c4762a1bSJed Brown Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 2 2c4762a1bSJed Brown Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 1 3c4762a1bSJed BrownNonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 1 4c4762a1bSJed BrownSNES Object: 2 MPI processes 5c4762a1bSJed Brown type: newtonls 6c4762a1bSJed Brown maximum iterations=50, maximum function evaluations=10000 7c4762a1bSJed Brown tolerances: relative=0.01, absolute=-1., solution=1e-08 8c4762a1bSJed Brown total number of linear solver iterations=16 9c4762a1bSJed Brown norm schedule ALWAYS 10c4762a1bSJed Brown total number of grid sequence refinements=2 11c4762a1bSJed Brown Jacobian is applied matrix-free with differencing 12c4762a1bSJed Brown Preconditioning Jacobian is built using a DMDA local Jacobian 13c4762a1bSJed Brown SNESLineSearch Object: 2 MPI processes 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 20c4762a1bSJed Brown KSP Object: 2 MPI processes 21c4762a1bSJed Brown type: gmres 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 left preconditioning 27c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 28c4762a1bSJed Brown PC Object: 2 MPI processes 29c4762a1bSJed Brown type: mg 30c4762a1bSJed Brown type is MULTIPLICATIVE, levels=3 cycles=v 31c4762a1bSJed Brown Cycles per PCApply=1 32c4762a1bSJed Brown Not using Galerkin computed coarse grid matrices 3363a3b9bcSJacob Faibussowitsch Coarse grid solver -- level 0 ------------------------------- 34c4762a1bSJed Brown KSP Object: (mg_coarse_) 2 MPI processes 35c4762a1bSJed Brown type: preonly 36c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 37c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 38c4762a1bSJed Brown left preconditioning 398405740aSBarry Smith not checking for convergence 40c4762a1bSJed Brown PC Object: (mg_coarse_) 2 MPI processes 41c4762a1bSJed Brown type: redundant 42c4762a1bSJed Brown First (color=0) of 2 PCs follows 438cc725e6SPierre Jolivet KSP Object: (mg_coarse_redundant_) 1 MPI process 44c4762a1bSJed Brown type: preonly 45c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 46c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 47c4762a1bSJed Brown left preconditioning 488405740aSBarry Smith not checking for convergence 498cc725e6SPierre Jolivet PC Object: (mg_coarse_redundant_) 1 MPI process 50c4762a1bSJed Brown type: lu 51c4762a1bSJed Brown out-of-place factorization 52c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 53c4762a1bSJed Brown using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 54c4762a1bSJed Brown matrix ordering: nd 55c4762a1bSJed Brown factor fill ratio given 5., needed 1.875 56ecf3d421SBarry Smith Factored matrix: 5726cc229bSBarry Smith Mat Object: (mg_coarse_redundant_) 1 MPI process 58c4762a1bSJed Brown type: seqaij 59c4762a1bSJed Brown rows=16, cols=16 60c4762a1bSJed Brown package used to perform factorization: petsc 61c4762a1bSJed Brown total: nonzeros=120, allocated nonzeros=120 62c4762a1bSJed Brown using I-node routines: found 12 nodes, limit used is 5 63ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 6426cc229bSBarry Smith Mat Object: 1 MPI process 65c4762a1bSJed Brown type: seqaij 66c4762a1bSJed Brown rows=16, cols=16 67c4762a1bSJed Brown total: nonzeros=64, allocated nonzeros=64 68c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 69c4762a1bSJed Brown not using I-node routines 70ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 71c4762a1bSJed Brown Mat Object: 2 MPI processes 72c4762a1bSJed Brown type: mpiaij 73c4762a1bSJed Brown rows=16, cols=16 74c4762a1bSJed Brown total: nonzeros=64, allocated nonzeros=64 75c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 76c4762a1bSJed Brown Down solver (pre-smoother) on level 1 ------------------------------- 77c4762a1bSJed Brown KSP Object: (mg_levels_1_) 2 MPI processes 78c4762a1bSJed Brown type: chebyshev 79f2edd1f0SMalachi Phillips Chebyshev polynomial of first kind 8073f7197eSJed Brown eigenvalue targets used: min 0.12873, max 1.41603 8173f7197eSJed Brown eigenvalues estimated via gmres: min 0.220124, max 1.2873 8273f7197eSJed Brown eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1] 83c4762a1bSJed Brown KSP Object: (mg_levels_1_esteig_) 2 MPI processes 84c4762a1bSJed Brown type: gmres 85f971d498SPierre Jolivet restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 86*143f2514SPierre Jolivet happy breakdown tolerance=1e-30 87c4762a1bSJed Brown maximum iterations=10, initial guess is zero 88c4762a1bSJed Brown tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 89c4762a1bSJed Brown left preconditioning 90c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 91dd8e379bSPierre Jolivet estimating eigenvalues using a noisy random number generated right-hand side 92c4762a1bSJed Brown maximum iterations=2, nonzero initial guess 93c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 94c4762a1bSJed Brown left preconditioning 958405740aSBarry Smith not checking for convergence 96c4762a1bSJed Brown PC Object: (mg_levels_1_) 2 MPI processes 97c4762a1bSJed Brown type: sor 98c4762a1bSJed Brown type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 99ecf3d421SBarry Smith linear system matrix, which is also used to construct the preconditioner: 100c4762a1bSJed Brown Mat Object: 2 MPI processes 101c4762a1bSJed Brown type: mpiaij 102c4762a1bSJed Brown rows=49, cols=49 103c4762a1bSJed Brown total: nonzeros=217, allocated nonzeros=217 104c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 105c4762a1bSJed Brown Up solver (post-smoother) same as down solver (pre-smoother) 106c4762a1bSJed Brown Down solver (pre-smoother) on level 2 ------------------------------- 107c4762a1bSJed Brown KSP Object: (mg_levels_2_) 2 MPI processes 108c4762a1bSJed Brown type: chebyshev 109f2edd1f0SMalachi Phillips Chebyshev polynomial of first kind 11073f7197eSJed Brown eigenvalue targets used: min 0.126369, max 1.39006 11173f7197eSJed Brown eigenvalues estimated via gmres: min 0.0725743, max 1.26369 11273f7197eSJed Brown eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1] 113c4762a1bSJed Brown KSP Object: (mg_levels_2_esteig_) 2 MPI processes 114c4762a1bSJed Brown type: gmres 115f971d498SPierre Jolivet restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 116*143f2514SPierre Jolivet happy breakdown tolerance=1e-30 117c4762a1bSJed Brown maximum iterations=10, initial guess is zero 118c4762a1bSJed Brown tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 119c4762a1bSJed Brown left preconditioning 120c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 121dd8e379bSPierre Jolivet estimating eigenvalues using a noisy random number generated right-hand side 122c4762a1bSJed Brown maximum iterations=2, nonzero initial guess 123c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 124c4762a1bSJed Brown left preconditioning 1258405740aSBarry Smith not checking for convergence 126c4762a1bSJed Brown PC Object: (mg_levels_2_) 2 MPI processes 127c4762a1bSJed Brown type: sor 128c4762a1bSJed Brown type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 129ecf3d421SBarry Smith linear system matrix, followed by the matrix used to construct the preconditioner: 130c4762a1bSJed Brown Mat Object: 2 MPI processes 131c4762a1bSJed Brown type: mffd 132c4762a1bSJed Brown rows=169, cols=169 133c4762a1bSJed Brown Matrix-free approximation: 134c4762a1bSJed Brown err=1.49012e-08 (relative error in function evaluation) 135c4762a1bSJed Brown Using wp compute h routine 136c4762a1bSJed Brown Does not compute normU 137c4762a1bSJed Brown Mat Object: 2 MPI processes 138c4762a1bSJed Brown type: mpiaij 139c4762a1bSJed Brown rows=169, cols=169 140c4762a1bSJed Brown total: nonzeros=793, allocated nonzeros=793 141c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 142c4762a1bSJed Brown Up solver (post-smoother) same as down solver (pre-smoother) 143ecf3d421SBarry Smith linear system matrix, followed by the matrix used to construct the preconditioner: 144c4762a1bSJed Brown Mat Object: 2 MPI processes 145c4762a1bSJed Brown type: mffd 146c4762a1bSJed Brown rows=169, cols=169 147c4762a1bSJed Brown Matrix-free approximation: 148c4762a1bSJed Brown err=1.49012e-08 (relative error in function evaluation) 149c4762a1bSJed Brown Using wp compute h routine 150c4762a1bSJed Brown Does not compute normU 151c4762a1bSJed Brown Mat Object: 2 MPI processes 152c4762a1bSJed Brown type: mpiaij 153c4762a1bSJed Brown rows=169, cols=169 154c4762a1bSJed Brown total: nonzeros=793, allocated nonzeros=793 155c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 156