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.0134978 time 0.115991 1413 TS dt 0.0135226 time 0.129489 1514 TS dt 0.00489716 time 0.133803 1615 TS dt 0.0100093 time 0.138701 1716 TS dt 0.0135687 time 0.14871 1817 TS dt 0.0136082 time 0.162279 1918 TS dt 0.00446971 time 0.166008 2019 TS dt 0.00866287 time 0.170477 2120 TS dt 0.0135473 time 0.17914 2221 TS dt 0.0136978 time 0.192687 2322 TS dt 0.00526418 time 0.197319 2423 TS dt 0.0107839 time 0.202584 2524 TS dt 0.0137429 time 0.213367 2625 TS dt 0.0137688 time 0.22711 2726 TS dt 0.0037576 time 0.229776 2827 TS dt 0.00611756 time 0.233534 2928 TS dt 0.01188 time 0.239651 3029 TS dt 0.0138528 time 0.251531 3130 TS dt 0.0136247 time 0.265384 3231 TS dt 0.00266463 time 0.26702 3332 TS dt 0.00360038 time 0.269684 3433 TS dt 0.00580701 time 0.273285 3534 TS dt 0.0111362 time 0.279092 3635 TS dt 0.013942 time 0.290228 3736 TS dt 0.0138468 time 0.30417 38TS Object: 1 MPI processes 39 type: arkimex 40 ARK IMEX 3 41 Stiff abscissa ct = 0.000000 0.871733 0.600000 1.000000 42 Fully implicit: no 43 Stiffly accurate: yes 44 Explicit first stage: yes 45 FSAL property: yes 46 Nonstiff abscissa c = 0.000000 0.871733 0.600000 1.000000 47 maximum steps=1000 48 maximum time=0.3 49 total number of nonlinear solver iterations=276 50 total number of linear solver iterations=552 51 total number of nonlinear solve failures=0 52 total number of rejected steps=10 53 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 54TSAdapt Object: 1 MPI processes 55 type: basic 56 safety factor 0.9 57 extra safety factor after step rejection 0.5 58 clip fastest increase 10. 59 clip fastest decrease 0.1 60 maximum allowed timestep 1e+20 61 minimum allowed timestep 1e-20 62 maximum solution absolute value to be ignored -1. 63SNES Object: 1 MPI processes 64 type: newtonls 65 maximum iterations=50, maximum function evaluations=10000 66 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 67 total number of linear solver iterations=4 68 total number of function evaluations=3 69 norm schedule ALWAYS 70 SNESLineSearch Object: 1 MPI processes 71 type: bt 72 interpolation: cubic 73 alpha=1.000000e-04 74 maxstep=1.000000e+08, minlambda=1.000000e-12 75 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 76 maximum iterations=40 77 KSP Object: 1 MPI processes 78 type: gmres 79 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 80 happy breakdown tolerance 1e-30 81 maximum iterations=10000, initial guess is zero 82 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 83 left preconditioning 84 using PRECONDITIONED norm type for convergence test 85 PC Object: 1 MPI processes 86 type: mg 87 type is MULTIPLICATIVE, levels=3 cycles=v 88 Cycles per PCApply=1 89 Not using Galerkin computed coarse grid matrices 90 Coarse grid solver -- level ------------------------------- 91 KSP Object: (mg_coarse_) 1 MPI processes 92 type: preonly 93 maximum iterations=10000, initial guess is zero 94 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 95 left preconditioning 96 using NONE norm type for convergence test 97 PC Object: (mg_coarse_) 1 MPI processes 98 type: lu 99 out-of-place factorization 100 tolerance for zero pivot 2.22045e-14 101 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 102 matrix ordering: nd 103 factor fill ratio given 5., needed 1.63333 104 Factored matrix follows: 105 Mat Object: 1 MPI processes 106 type: seqaij 107 rows=60, cols=60 108 package used to perform factorization: petsc 109 total: nonzeros=294, allocated nonzeros=294 110 total number of mallocs used during MatSetValues calls=0 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