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 4 Linear solve converged due to CONVERGED_RTOL iterations 1 5 Linear solve converged due to CONVERGED_RTOL iterations 1 6 Linear solve converged due to CONVERGED_RTOL iterations 1 7Timestep 1: step size = 0.000504055, time = 0.000143637, 2-norm error = 0.000290581, max norm error = 0.0004186 8 Linear solve converged due to CONVERGED_RTOL iterations 1 9 Linear solve converged due to CONVERGED_RTOL iterations 1 10 Linear solve converged due to CONVERGED_RTOL iterations 1 11 Linear solve converged due to CONVERGED_RTOL iterations 1 12Timestep 2: step size = 0.000500257, time = 0.000647692, 2-norm error = 0.0010422, max norm error = 0.00150753 13 Linear solve converged due to CONVERGED_RTOL iterations 1 14 Linear solve converged due to CONVERGED_RTOL iterations 1 15 Linear solve converged due to CONVERGED_RTOL iterations 1 16 Linear solve converged due to CONVERGED_RTOL iterations 1 17Timestep 3: step size = 0.000526001, time = 0.00114795, 2-norm error = 0.0015392, max norm error = 0.0022348 18avg. error (2 norm) = 0.000957327, avg. error (max norm) = 0.00138698 19TS Object: 1 MPI process 20 type: rosw 21 Rosenbrock-W ra34pw2 22 Abscissa of A = 0.000000 0.871733 0.731580 1.000000 23 Abscissa of A+Gamma = 0.435867 0.871733 0.731580 1.000000 24 initial time step=0.000143637 25 maximum steps=3 26 maximum time=100. 27 maximum number of step rejections=10 28 maximum number of SNES failures allowed=1 29 total number of RHS function evaluations=12 30 total number of RHS Jacobian evaluations=12 31 total number of linear solver iterations=12 32 total number of linear solve failures=0 33 total number of rejected steps=0 34 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 35 TSAdapt Object: 1 MPI process 36 type: basic 37 safety factor 0.9 38 extra safety factor after step rejection 0.5 39 clip fastest increase 10. 40 clip fastest decrease 0.1 41 maximum allowed timestep 1e+20 42 minimum allowed timestep 1e-20 43 maximum solution absolute value to be ignored -1. 44 SNES Object: 1 MPI process 45 type: ksponly 46 maximum iterations=50, maximum function evaluations=10000 47 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 48 total number of linear solver iterations=1 49 total number of function evaluations=1 50 norm schedule ALWAYS 51 KSP Object: 1 MPI process 52 type: gmres 53 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 54 happy breakdown tolerance=1e-30 55 maximum iterations=10000, initial guess is zero 56 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 57 left preconditioning 58 using PRECONDITIONED norm type for convergence test 59 PC Object: 1 MPI process 60 type: ilu 61 out-of-place factorization 62 0 levels of fill 63 tolerance for zero pivot 2.22045e-14 64 matrix ordering: natural 65 factor fill ratio given 1., needed 1. 66 Factored matrix: 67 Mat Object: 1 MPI process 68 type: seqaij 69 rows=60, cols=60 70 package used to perform factorization: petsc 71 total: nonzeros=176, allocated nonzeros=176 72 not using I-node routines 73 linear system matrix, followed by the matrix used to construct the preconditioner: 74 Mat Object: 1 MPI process 75 type: seqaij 76 rows=60, cols=60 77 total: nonzeros=176, allocated nonzeros=176 78 total number of mallocs used during MatSetValues calls=0 79 not using I-node routines 80 Mat Object: 1 MPI process 81 type: seqaij 82 rows=60, cols=60 83 total: nonzeros=176, allocated nonzeros=176 84 total number of mallocs used during MatSetValues calls=0 85 not using I-node routines 86