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 process 11 type: beuler 12 initial time step=0.000143637 13 maximum steps=3 14 maximum time=100. 15 maximum number of step rejections=10 16 maximum number of SNES failures allowed=1 17 total number of RHS function evaluations=3 18 total number of RHS Jacobian evaluations=6 19 total number of linear solver iterations=3 20 total number of linear solve failures=0 21 total number of rejected steps=0 22 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 23 TSAdapt Object: 1 MPI process 24 type: none 25 SNES Object: 1 MPI process 26 type: ksponly 27 maximum iterations=50, maximum function evaluations=10000 28 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 29 total number of linear solver iterations=1 30 total number of function evaluations=1 31 norm schedule ALWAYS 32 KSP Object: 1 MPI process 33 type: gmres 34 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 35 happy breakdown tolerance=1e-30 36 maximum iterations=10000, initial guess is zero 37 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 38 left preconditioning 39 using PRECONDITIONED norm type for convergence test 40 PC Object: 1 MPI process 41 type: ilu 42 out-of-place factorization 43 0 levels of fill 44 tolerance for zero pivot 2.22045e-14 45 matrix ordering: natural 46 factor fill ratio given 1., needed 1. 47 Factored matrix: 48 Mat Object: 1 MPI process 49 type: seqaij 50 rows=60, cols=60 51 package used to perform factorization: petsc 52 total: nonzeros=176, allocated nonzeros=176 53 not using I-node routines 54 linear system matrix, which is also used to construct the preconditioner: 55 Mat Object: 1 MPI process 56 type: seqaij 57 rows=60, cols=60 58 total: nonzeros=176, allocated nonzeros=176 59 total number of mallocs used during MatSetValues calls=0 60 not using I-node routines 61