0 TS dt 8.33333e-06 time 0.
1 TS dt 8.33333e-05 time 8.33333e-06
2 TS dt 0.000833333 time 9.16667e-05
3 TS dt 0.00833333 time 0.000925
4 TS dt 0.0132237 time 0.00925833
5 TS dt 0.0132566 time 0.022482
6 TS dt 0.0132919 time 0.0357387
7 TS dt 0.0133226 time 0.0490305
8 TS dt 0.0133482 time 0.0623531
9 TS dt 0.0133897 time 0.0757014
10 TS dt 0.0134319 time 0.0890911
11 TS dt 0.0134682 time 0.102523
12 TS dt 0.0134977 time 0.115991
13 TS dt 0.0135238 time 0.129489
14 TS dt 0.00492864 time 0.133807
15 TS dt 0.0101278 time 0.138735
16 TS dt 0.0135716 time 0.148863
17 TS dt 0.0136056 time 0.162435
18 TS dt 0.00439871 time 0.166038
19 TS dt 0.00840205 time 0.170437
20 TS dt 0.013518 time 0.178839
21 TS dt 0.0136938 time 0.192357
22 TS dt 0.00546476 time 0.19723
23 TS dt 0.0109614 time 0.202694
24 TS dt 0.0137452 time 0.213656
25 TS dt 0.013756 time 0.227401
26 TS dt 0.00349335 time 0.229813
27 TS dt 0.00543395 time 0.233306
28 TS dt 0.0103961 time 0.23874
29 TS dt 0.0138226 time 0.249136
30 TS dt 0.0138435 time 0.262959
31 TS dt 0.00357575 time 0.265381
32 TS dt 0.0055737 time 0.268957
33 TS dt 0.010729 time 0.274531
34 TS dt 0.0139273 time 0.28526
35 TS dt 0.0138959 time 0.299187
36 TS dt 0.00330856 time 0.30133
TS Object: 1 MPI processes
  type: arkimex
    ARK IMEX 3
    Stiff abscissa       ct =  0.000000  0.871733  0.600000  1.000000 
  Fully implicit: no
  Stiffly accurate: yes
  Explicit first stage: yes
  FSAL property: yes
    Nonstiff abscissa     c =  0.000000  0.871733  0.600000  1.000000 
  maximum steps=1000
  maximum time=0.3
  using relative error tolerance of 0.0001,   using absolute error tolerance of 0.0001
TSAdapt Object: 1 MPI processes
  type: basic
  safety factor 0.9
  extra safety factor after step rejection 0.5
  clip fastest increase 10.
  clip fastest decrease 0.1
  maximum allowed timestep 1e+20
  minimum allowed timestep 1e-20
  maximum solution absolute value to be ignored -1.
SNES Object: 1 MPI processes
  type: newtonls
  maximum iterations=50, maximum function evaluations=10000
  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
  norm schedule ALWAYS
  SNESLineSearch Object: 1 MPI processes
    type: bt
      interpolation: cubic
      alpha=1.000000e-04
    maxstep=1.000000e+08, minlambda=1.000000e-12
    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
    maximum iterations=40
  KSP Object: 1 MPI processes
    type: gmres
      restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      happy breakdown tolerance 1e-30
    maximum iterations=10000, initial guess is zero
    tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object: 1 MPI processes
    type: mg
      type is MULTIPLICATIVE, levels=3 cycles=v
        Cycles per PCApply=1
        Not using Galerkin computed coarse grid matrices
    Coarse grid solver -- level -------------------------------
      KSP Object: (mg_coarse_) 1 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (mg_coarse_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          using diagonal shift on blocks to prevent zero pivot [INBLOCKS]
          matrix ordering: nd
          factor fill ratio given 5., needed 1.63333
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=60, cols=60
                package used to perform factorization: petsc
                total: nonzeros=294, allocated nonzeros=294
                  not using I-node routines
        linear system matrix = precond matrix:
        Mat Object: 1 MPI processes
          type: seqaij
          rows=60, cols=60
          total: nonzeros=180, allocated nonzeros=180
            not using I-node routines
    Down solver (pre-smoother) on level 1 -------------------------------
      KSP Object: (mg_levels_1_) 1 MPI processes
        type: chebyshev
          eigenvalue targets used: min 0.1, max 1.1
          eigenvalues estimated via gmres: min 1., max 1.
          eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1]
          KSP Object: (mg_levels_1_esteig_) 1 MPI processes
            type: gmres
              restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
              happy breakdown tolerance 1e-30
            maximum iterations=10, initial guess is zero
            tolerances:  relative=1e-12, absolute=1e-50, divergence=10000.
            left preconditioning
            using PRECONDITIONED norm type for convergence test
          estimating eigenvalues using noisy right hand side
        maximum iterations=3, nonzero initial guess
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (mg_levels_1_) 1 MPI processes
        type: sor
          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
        linear system matrix = precond matrix:
        Mat Object: 1 MPI processes
          type: seqaij
          rows=120, cols=120
          total: nonzeros=360, allocated nonzeros=360
            not using I-node routines
    Up solver (post-smoother) same as down solver (pre-smoother)
    Down solver (pre-smoother) on level 2 -------------------------------
      KSP Object: (mg_levels_2_) 1 MPI processes
        type: chebyshev
          eigenvalue targets used: min 0.1, max 1.1
          eigenvalues estimated via gmres: min 1., max 1.
          eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1]
          KSP Object: (mg_levels_2_esteig_) 1 MPI processes
            type: gmres
              restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
              happy breakdown tolerance 1e-30
            maximum iterations=10, initial guess is zero
            tolerances:  relative=1e-12, absolute=1e-50, divergence=10000.
            left preconditioning
            using PRECONDITIONED norm type for convergence test
          estimating eigenvalues using noisy right hand side
        maximum iterations=3, nonzero initial guess
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (mg_levels_2_) 1 MPI processes
        type: sor
          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
        linear system matrix = precond matrix:
        Mat Object: 1 MPI processes
          type: seqaij
          rows=240, cols=240
          total: nonzeros=720, allocated nonzeros=720
            not using I-node routines
    Up solver (post-smoother) same as down solver (pre-smoother)
    linear system matrix = precond matrix:
    Mat Object: 1 MPI processes
      type: seqaij
      rows=240, cols=240
      total: nonzeros=720, allocated nonzeros=720
        not using I-node routines
