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 nonlinear solver iterations=270 49 total number of linear solver iterations=540 50 total number of nonlinear solve failures=0 51 total number of rejected steps=10 52 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 53TSAdapt Object: 1 MPI processes 54 type: basic 55 safety factor 0.9 56 extra safety factor after step rejection 0.5 57 clip fastest increase 10. 58 clip fastest decrease 0.1 59 maximum allowed timestep 1e+20 60 minimum allowed timestep 1e-20 61 maximum solution absolute value to be ignored -1. 62SNES Object: 1 MPI processes 63 type: newtonls 64 maximum iterations=50, maximum function evaluations=10000 65 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 66 total number of linear solver iterations=4 67 total number of function evaluations=3 68 norm schedule ALWAYS 69 SNESLineSearch Object: 1 MPI processes 70 type: bt 71 interpolation: cubic 72 alpha=1.000000e-04 73 maxstep=1.000000e+08, minlambda=1.000000e-12 74 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 75 maximum iterations=40 76 KSP Object: 1 MPI processes 77 type: gmres 78 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 79 happy breakdown tolerance 1e-30 80 maximum iterations=10000, initial guess is zero 81 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 82 left preconditioning 83 using PRECONDITIONED norm type for convergence test 84 PC Object: 1 MPI processes 85 type: mg 86 type is MULTIPLICATIVE, levels=3 cycles=v 87 Cycles per PCApply=1 88 Not using Galerkin computed coarse grid matrices 89 Coarse grid solver -- level ------------------------------- 90 KSP Object: (mg_coarse_) 1 MPI processes 91 type: preonly 92 maximum iterations=10000, initial guess is zero 93 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 94 left preconditioning 95 using NONE norm type for convergence test 96 PC Object: (mg_coarse_) 1 MPI processes 97 type: lu 98 out-of-place factorization 99 tolerance for zero pivot 2.22045e-14 100 using diagonal shift on blocks to prevent zero pivot [INBLOCKS] 101 matrix ordering: nd 102 factor fill ratio given 5., needed 1.63333 103 Factored matrix follows: 104 Mat Object: 1 MPI processes 105 type: seqaij 106 rows=60, cols=60 107 package used to perform factorization: petsc 108 total: nonzeros=294, allocated nonzeros=294 109 total number of mallocs used during MatSetValues calls=0 110 not using I-node routines 111 linear system matrix = precond matrix: 112 Mat Object: 1 MPI processes 113 type: seqaij 114 rows=60, cols=60 115 total: nonzeros=180, allocated nonzeros=180 116 total number of mallocs used during MatSetValues calls=0 117 not using I-node routines 118 Down solver (pre-smoother) on level 1 ------------------------------- 119 KSP Object: (mg_levels_1_) 1 MPI processes 120 type: chebyshev 121 eigenvalue estimates used: min = 0.1, max = 1.1 122 eigenvalues estimate via gmres min 1., max 1. 123 eigenvalues estimated using gmres with translations [0. 0.1; 0. 1.1] 124 KSP Object: (mg_levels_1_esteig_) 1 MPI processes 125 type: gmres 126 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 127 happy breakdown tolerance 1e-30 128 maximum iterations=10, initial guess is zero 129 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 130 left preconditioning 131 using PRECONDITIONED norm type for convergence test 132 estimating eigenvalues using noisy right hand side 133 maximum iterations=3, nonzero initial guess 134 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 135 left preconditioning 136 using NONE norm type for convergence test 137 PC Object: (mg_levels_1_) 1 MPI processes 138 type: sor 139 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 140 linear system matrix = precond matrix: 141 Mat Object: 1 MPI processes 142 type: seqaij 143 rows=120, cols=120 144 total: nonzeros=360, allocated nonzeros=360 145 total number of mallocs used during MatSetValues calls=0 146 not using I-node routines 147 Up solver (post-smoother) same as down solver (pre-smoother) 148 Down solver (pre-smoother) on level 2 ------------------------------- 149 KSP Object: (mg_levels_2_) 1 MPI processes 150 type: chebyshev 151 eigenvalue estimates used: min = 0.1, max = 1.1 152 eigenvalues estimate via gmres min 1., max 1. 153 eigenvalues estimated using gmres with translations [0. 0.1; 0. 1.1] 154 KSP Object: (mg_levels_2_esteig_) 1 MPI processes 155 type: gmres 156 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 157 happy breakdown tolerance 1e-30 158 maximum iterations=10, initial guess is zero 159 tolerances: relative=1e-12, absolute=1e-50, divergence=10000. 160 left preconditioning 161 using PRECONDITIONED norm type for convergence test 162 estimating eigenvalues using noisy right hand side 163 maximum iterations=3, nonzero initial guess 164 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 165 left preconditioning 166 using NONE norm type for convergence test 167 PC Object: (mg_levels_2_) 1 MPI processes 168 type: sor 169 type = local_symmetric, iterations = 1, local iterations = 1, omega = 1. 170 linear system matrix = precond matrix: 171 Mat Object: 1 MPI processes 172 type: seqaij 173 rows=240, cols=240 174 total: nonzeros=720, allocated nonzeros=720 175 total number of mallocs used during MatSetValues calls=0 176 not using I-node routines 177 Up solver (post-smoother) same as down solver (pre-smoother) 178 linear system matrix = precond matrix: 179 Mat Object: 1 MPI processes 180 type: seqaij 181 rows=240, cols=240 182 total: nonzeros=720, allocated nonzeros=720 183 total number of mallocs used during MatSetValues calls=0 184 not using I-node routines 185