1Solving a linear TS problem on 1 processor 2Timestep 0: step size = 0.000143637, time = 0., 2-norm error = 0., max norm error = 0. 3 Linear solve converged due to CONVERGED_RTOL iterations 1 4Timestep 1: step size = 0.000143637, time = 0.000143637, 2-norm error = 0.00112483, max norm error = 0.00162124 5 Linear solve converged due to CONVERGED_RTOL iterations 1 6Timestep 2: step size = 0.000143637, time = 0.000287274, 2-norm error = 0.00213968, max norm error = 0.00308653 7 Linear solve converged due to CONVERGED_RTOL iterations 1 8Timestep 3: step size = 0.000143637, time = 0.000430911, 2-norm error = 0.00305264, max norm error = 0.0044073 9avg. error (2 norm) = 0.00210572, avg. error (max norm) = 0.00303835 10TS Object: 1 MPI processes 11 type: beuler 12 maximum steps=3 13 maximum time=100. 14 total number of RHS function evaluations=3 15 total number of RHS Jacobian evaluations=6 16 total number of linear solver iterations=3 17 total number of linear solve failures=0 18 total number of rejected steps=0 19 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 20 TSAdapt Object: 1 MPI processes 21 type: none 22 SNES Object: 1 MPI processes 23 type: ksponly 24 maximum iterations=50, maximum function evaluations=10000 25 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 26 total number of linear solver iterations=1 27 total number of function evaluations=1 28 norm schedule ALWAYS 29 KSP Object: 1 MPI processes 30 type: gmres 31 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 32 happy breakdown tolerance 1e-30 33 maximum iterations=10000, initial guess is zero 34 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 35 left preconditioning 36 using PRECONDITIONED norm type for convergence test 37 PC Object: 1 MPI processes 38 type: ilu 39 out-of-place factorization 40 0 levels of fill 41 tolerance for zero pivot 2.22045e-14 42 matrix ordering: natural 43 factor fill ratio given 1., needed 1. 44 Factored matrix follows: 45 Mat Object: 1 MPI processes 46 type: seqaij 47 rows=60, cols=60 48 package used to perform factorization: petsc 49 total: nonzeros=176, allocated nonzeros=176 50 not using I-node routines 51 linear system matrix followed by preconditioner matrix: 52 Mat Object: 1 MPI processes 53 type: seqaij 54 rows=60, cols=60 55 total: nonzeros=176, allocated nonzeros=176 56 total number of mallocs used during MatSetValues calls=0 57 not using I-node routines 58 Mat Object: 1 MPI processes 59 type: seqaij 60 rows=60, cols=60 61 total: nonzeros=176, allocated nonzeros=176 62 total number of mallocs used during MatSetValues calls=0 63 not using I-node routines 64