1 0 SNES Function norm 0.467874 2 0 KSP Residual norm 0.216401 3 1 KSP Residual norm 0.0553349 4 2 KSP Residual norm 0.0212547 5 3 KSP Residual norm 0.0048176 6 4 KSP Residual norm 0.0021287 7 5 KSP Residual norm 0.00100956 8 6 KSP Residual norm 0.000532496 9 7 KSP Residual norm 0.000209007 10 8 KSP Residual norm 0.000139492 11 9 KSP Residual norm 0.000173401 12 10 KSP Residual norm 0.000225398 13 11 KSP Residual norm 0.000178771 14 12 KSP Residual norm 0.000135484 15 13 KSP Residual norm 0.00012088 16 14 KSP Residual norm 0.000101858 17 15 KSP Residual norm 5.80403e-05 18 16 KSP Residual norm 3.43514e-05 19 17 KSP Residual norm 3.29735e-05 20 18 KSP Residual norm 1.64922e-05 21 19 KSP Residual norm 1.48312e-05 22 20 KSP Residual norm 1.25128e-05 23 21 KSP Residual norm 8.36054e-06 24 22 KSP Residual norm 4.02426e-06 25 23 KSP Residual norm 4.6593e-06 26 24 KSP Residual norm 5.72482e-06 27 25 KSP Residual norm 4.00111e-06 28 26 KSP Residual norm 3.46507e-06 29 27 KSP Residual norm 3.96412e-06 30 28 KSP Residual norm 3.05863e-06 31 29 KSP Residual norm 2.09907e-06 32KSP Object: 5 MPI processes 33 type: cg 34 maximum iterations=10000, initial guess is zero 35 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 36 left preconditioning 37 using NATURAL norm type for convergence test 38PC Object: 5 MPI processes 39 type: mg 40 type is MULTIPLICATIVE, levels=2 cycles=v 41 Cycles per PCApply=1 42 Using Galerkin computed coarse grid matrices 43 Coarse grid solver -- level 0 ------------------------------- 44 KSP Object: (mg_coarse_) 5 MPI processes 45 type: preonly 46 maximum iterations=10000, initial guess is zero 47 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 48 left preconditioning 49 using NONE norm type for convergence test 50 PC Object: (mg_coarse_) 5 MPI processes 51 type: redundant 52 First (color=0) of 5 PCs follows 53 KSP Object: (mg_coarse_redundant_) 1 MPI process 54 type: preonly 55 maximum iterations=10000, initial guess is zero 56 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 57 left preconditioning 58 using NONE norm type for convergence test 59 PC Object: (mg_coarse_redundant_) 1 MPI process 60 type: cholesky 61 out-of-place factorization 62 tolerance for zero pivot 2.22045e-14 63 matrix ordering: nd 64 factor fill ratio given 5., needed 1. 65 Factored matrix follows: 66 Mat Object: (mg_coarse_redundant_) 1 MPI process 67 type: seqsbaij 68 rows=50, cols=50 69 package used to perform factorization: petsc 70 total: nonzeros=1275, allocated nonzeros=1275 71 block size is 1 72 linear system matrix = precond matrix: 73 Mat Object: 1 MPI process 74 type: seqaij 75 rows=50, cols=50 76 total: nonzeros=2500, allocated nonzeros=2500 77 total number of mallocs used during MatSetValues calls=0 78 using I-node routines: found 10 nodes, limit used is 5 79 linear system matrix = precond matrix: 80 Mat Object: 5 MPI processes 81 type: mpiaij 82 rows=50, cols=50 83 total: nonzeros=2500, allocated nonzeros=2500 84 total number of mallocs used during MatSetValues calls=0 85 using nonscalable MatPtAP() implementation 86 using I-node (on process 0) routines: found 2 nodes, limit used is 5 87 Down solver (pre-smoother) on level 1 ------------------------------- 88 KSP Object: (mg_levels_1_) 5 MPI processes 89 type: chebyshev 90 Chebyshev polynomial of first kind 91 eigenvalue targets used: min 0.237828, max 2.61611 92 eigenvalues estimated via cg: min 0.0240432, max 2.37828 93 eigenvalues estimated using cg with transform: [0. 0.1; 0. 1.1] 94 KSP Object: (mg_levels_1_esteig_) 5 MPI processes 95 type: cg 96 maximum iterations=10, initial guess is zero 97 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 98 left preconditioning 99 using PRECONDITIONED norm type for convergence test 100 PC Object: 5 MPI processes 101 type: mg 102 PC has not been set up so information may be incomplete 103 type is MULTIPLICATIVE, levels=2 cycles=v 104 Cycles per PCApply=1 105 Using Galerkin computed coarse grid matrices 106 Coarse grid solver -- level 0 ------------------------------- 107 KSP Object: (mg_coarse_) 5 MPI processes 108 type: preonly 109 maximum iterations=10000, initial guess is zero 110 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 111 left preconditioning 112 using DEFAULT norm type for convergence test 113 PC Object: (mg_coarse_) 5 MPI processes 114 type: redundant 115 PC has not been set up so information may be incomplete 116 Not yet setup 117 Down solver (pre-smoother) on level 1 ------------------------------- 118 KSP Object: (mg_levels_1_) 5 MPI processes 119 type: chebyshev 120 Chebyshev polynomial of first kind 121 eigenvalue targets used: min 0., max 0. 122 maximum iterations=2, initial guess is zero 123 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 124 left preconditioning 125 using NONE norm type for convergence test 126 PC Object: (mg_levels_1_) 5 MPI processes 127 type: sor 128 PC has not been set up so information may be incomplete 129 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 130 Up solver (post-smoother) same as down solver (pre-smoother) 131 estimating eigenvalues using noisy right hand side 132 maximum iterations=2, nonzero initial guess 133 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 134 left preconditioning 135 using NONE norm type for convergence test 136 PC Object: (mg_levels_1_) 5 MPI processes 137 type: bjacobi 138 number of blocks = 5 139 Local solver information for first block is in the following KSP and PC objects on rank 0: 140 Use -mg_levels_1_ksp_view ::ascii_info_detail to display information for all blocks 141 KSP Object: (mg_levels_1_sub_) 1 MPI process 142 type: preonly 143 maximum iterations=10000, initial guess is zero 144 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 145 left preconditioning 146 using NONE norm type for convergence test 147 PC Object: (mg_levels_1_sub_) 1 MPI process 148 type: icc 149 out-of-place factorization 150 0 levels of fill 151 tolerance for zero pivot 2.22045e-14 152 using Manteuffel shift [POSITIVE_DEFINITE] 153 matrix ordering: natural 154 factor fill ratio given 1., needed 1. 155 Factored matrix follows: 156 Mat Object: (mg_levels_1_sub_) 1 MPI process 157 type: seqsbaij 158 rows=28, cols=28 159 package used to perform factorization: petsc 160 total: nonzeros=226, allocated nonzeros=226 161 block size is 1 162 linear system matrix = precond matrix: 163 Mat Object: (mg_levels_1_sub_) 1 MPI process 164 type: seqaij 165 rows=28, cols=28 166 total: nonzeros=424, allocated nonzeros=424 167 total number of mallocs used during MatSetValues calls=0 168 using I-node routines: found 10 nodes, limit used is 5 169 linear system matrix = precond matrix: 170 Mat Object: 5 MPI processes 171 type: mpiaij 172 rows=252, cols=252 173 total: nonzeros=11872, allocated nonzeros=11872 174 total number of mallocs used during MatSetValues calls=0 175 has attached near null space 176 using I-node (on process 0) routines: found 10 nodes, limit used is 5 177 Up solver (post-smoother) same as down solver (pre-smoother) 178 linear system matrix = precond matrix: 179 Mat Object: 5 MPI processes 180 type: mpiaij 181 rows=252, cols=252 182 total: nonzeros=11872, allocated nonzeros=11872 183 total number of mallocs used during MatSetValues calls=0 184 has attached near null space 185 using I-node (on process 0) routines: found 10 nodes, limit used is 5 186 1 SNES Function norm 5.93822e-06 187