10 TS dt 8.33333e-06 time 0. 21 TS dt 8.33333e-05 time 8.33333e-06 32 TS dt 0.000833333 time 9.16667e-05 43 TS dt 0.00833333 time 0.000925 54 TS dt 0.0132237 time 0.00925833 65 TS dt 0.0132566 time 0.022482 76 TS dt 0.0132919 time 0.0357387 87 TS dt 0.0133226 time 0.0490305 98 TS dt 0.0133482 time 0.0623531 109 TS dt 0.0133897 time 0.0757014 1110 TS dt 0.0134319 time 0.0890911 1211 TS dt 0.0134682 time 0.102523 1312 TS dt 0.0134977 time 0.115991 1413 TS dt 0.0135237 time 0.129489 1514 TS dt 0.00493711 time 0.133814 1615 TS dt 0.0101429 time 0.138751 1716 TS dt 0.0135717 time 0.148894 1817 TS dt 0.0136051 time 0.162466 1918 TS dt 0.00438633 time 0.166048 2019 TS dt 0.00835031 time 0.170435 2120 TS dt 0.01351 time 0.178785 2221 TS dt 0.0136929 time 0.192295 2322 TS dt 0.00550644 time 0.197218 2423 TS dt 0.0109745 time 0.202724 2524 TS dt 0.0137446 time 0.213699 2625 TS dt 0.013753 time 0.227443 2726 TS dt 0.00344297 time 0.229808 2827 TS dt 0.00530876 time 0.233251 2928 TS dt 0.0100847 time 0.23856 3029 TS dt 0.0138161 time 0.248645 3130 TS dt 0.0138536 time 0.262461 3231 TS dt 0.00379537 time 0.2651 3332 TS dt 0.00615405 time 0.268896 3433 TS dt 0.0119598 time 0.27505 3534 TS dt 0.0139434 time 0.287009 3635 TS dt 0.0136447 time 0.300953 37TS Object: 1 MPI processes 38 type: arkimex 39 ARK IMEX 3 40 Stiff abscissa ct = 0.000000 0.871733 0.600000 1.000000 41 Fully implicit: no 42 Stiffly accurate: yes 43 Explicit first stage: yes 44 FSAL property: yes 45 Nonstiff abscissa c = 0.000000 0.871733 0.600000 1.000000 46 maximum steps=1000 47 maximum time=0.3 48 total number of RHS function evaluations=180 49 total number of RHS Jacobian evaluations=180 50 total number of nonlinear solver iterations=270 51 total number of linear solver iterations=540 52 total number of nonlinear solve failures=0 53 total number of rejected steps=10 54 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 55TSAdapt Object: 1 MPI processes 56 type: basic 57 safety factor 0.9 58 extra safety factor after step rejection 0.5 59 clip fastest increase 10. 60 clip fastest decrease 0.1 61 maximum allowed timestep 1e+20 62 minimum allowed timestep 1e-20 63 maximum solution absolute value to be ignored -1. 64SNES Object: 1 MPI processes 65 type: newtonls 66 maximum iterations=50, maximum function evaluations=10000 67 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 68 total number of linear solver iterations=4 69 total number of function evaluations=3 70 norm schedule ALWAYS 71 SNESLineSearch Object: 1 MPI processes 72 type: bt 73 interpolation: cubic 74 alpha=1.000000e-04 75 maxstep=1.000000e+08, minlambda=1.000000e-12 76 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 77 maximum iterations=40 78 KSP Object: 1 MPI processes 79 type: gmres 80 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 81 happy breakdown tolerance 1e-30 82 maximum iterations=10000, initial guess is zero 83 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 84 left preconditioning 85 using PRECONDITIONED norm type for convergence test 86 PC Object: 1 MPI processes 87 type: mg 88 type is MULTIPLICATIVE, levels=3 cycles=v 89 Cycles per PCApply=1 90 Not using Galerkin computed coarse grid matrices 91 Coarse grid solver -- level ------------------------------- 92 KSP Object: (mg_coarse_) 1 MPI processes 93 type: preonly 94 maximum iterations=10000, initial guess is zero 95 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 96 left preconditioning 97 using NONE norm type for convergence test 98 PC Object: (mg_coarse_) 1 MPI processes 99 type: lu 100 out-of-place factorization 101 tolerance for zero pivot 2.22045e-14 102 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 103 matrix ordering: nd 104 factor fill ratio given 5., needed 1.63333 105 Factored matrix follows: 106 Mat Object: 1 MPI processes 107 type: seqaij 108 rows=60, cols=60 109 package used to perform factorization: petsc 110 total: nonzeros=294, allocated nonzeros=294 111 not using I-node routines 112 linear system matrix = precond matrix: 113 Mat Object: 1 MPI processes 114 type: seqaij 115 rows=60, cols=60 116 total: nonzeros=180, allocated nonzeros=180 117 total number of mallocs used during MatSetValues calls=0 118 not using I-node routines 119 Down solver (pre-smoother) on level 1 ------------------------------- 120 KSP Object: (mg_levels_1_) 1 MPI processes 121 type: chebyshev 122 eigenvalue estimates used: min = 0.1, max = 1.1 123 eigenvalues estimate via gmres min 1., max 1. 124 eigenvalues estimated using gmres with translations [0. 0.1; 0. 1.1] 125 KSP Object: (mg_levels_1_esteig_) 1 MPI processes 126 type: gmres 127 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 128 happy breakdown tolerance 1e-30 129 maximum iterations=10, initial guess is zero 130 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 131 left preconditioning 132 using PRECONDITIONED norm type for convergence test 133 estimating eigenvalues using noisy right hand side 134 maximum iterations=3, nonzero initial guess 135 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 136 left preconditioning 137 using NONE norm type for convergence test 138 PC Object: (mg_levels_1_) 1 MPI processes 139 type: sor 140 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 141 linear system matrix = precond matrix: 142 Mat Object: 1 MPI processes 143 type: seqaij 144 rows=120, cols=120 145 total: nonzeros=360, allocated nonzeros=360 146 total number of mallocs used during MatSetValues calls=0 147 not using I-node routines 148 Up solver (post-smoother) same as down solver (pre-smoother) 149 Down solver (pre-smoother) on level 2 ------------------------------- 150 KSP Object: (mg_levels_2_) 1 MPI processes 151 type: chebyshev 152 eigenvalue estimates used: min = 0.1, max = 1.1 153 eigenvalues estimate via gmres min 1., max 1. 154 eigenvalues estimated using gmres with translations [0. 0.1; 0. 1.1] 155 KSP Object: (mg_levels_2_esteig_) 1 MPI processes 156 type: gmres 157 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 158 happy breakdown tolerance 1e-30 159 maximum iterations=10, initial guess is zero 160 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 161 left preconditioning 162 using PRECONDITIONED norm type for convergence test 163 estimating eigenvalues using noisy right hand side 164 maximum iterations=3, nonzero initial guess 165 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 166 left preconditioning 167 using NONE norm type for convergence test 168 PC Object: (mg_levels_2_) 1 MPI processes 169 type: sor 170 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 171 linear system matrix = precond matrix: 172 Mat Object: 1 MPI processes 173 type: seqaij 174 rows=240, cols=240 175 total: nonzeros=720, allocated nonzeros=720 176 total number of mallocs used during MatSetValues calls=0 177 not using I-node routines 178 Up solver (post-smoother) same as down solver (pre-smoother) 179 linear system matrix = precond matrix: 180 Mat Object: 1 MPI processes 181 type: seqaij 182 rows=240, cols=240 183 total: nonzeros=720, allocated nonzeros=720 184 total number of mallocs used during MatSetValues calls=0 185 not using I-node routines 186