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 processes 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 maximum steps=3 25 maximum time=100. 26 total number of linear solver iterations=12 27 total number of linear solve failures=0 28 total number of rejected steps=0 29 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 30 TSAdapt Object: 1 MPI processes 31 type: basic 32 safety factor 0.9 33 extra safety factor after step rejection 0.5 34 clip fastest increase 10. 35 clip fastest decrease 0.1 36 maximum allowed timestep 1e+20 37 minimum allowed timestep 1e-20 38 maximum solution absolute value to be ignored -1. 39 SNES Object: 1 MPI processes 40 type: ksponly 41 maximum iterations=50, maximum function evaluations=10000 42 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 43 total number of linear solver iterations=1 44 total number of function evaluations=1 45 norm schedule ALWAYS 46 Jacobian is never rebuilt 47 KSP Object: 1 MPI processes 48 type: gmres 49 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 50 happy breakdown tolerance 1e-30 51 maximum iterations=10000, initial guess is zero 52 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 53 left preconditioning 54 using PRECONDITIONED norm type for convergence test 55 PC Object: 1 MPI processes 56 type: ilu 57 out-of-place factorization 58 0 levels of fill 59 tolerance for zero pivot 2.22045e-14 60 matrix ordering: natural 61 factor fill ratio given 1., needed 1. 62 Factored matrix follows: 63 Mat Object: 1 MPI processes 64 type: seqaij 65 rows=60, cols=60 66 package used to perform factorization: petsc 67 total: nonzeros=176, allocated nonzeros=176 68 total number of mallocs used during MatSetValues calls=0 69 not using I-node routines 70 linear system matrix followed by preconditioner matrix: 71 Mat Object: 1 MPI processes 72 type: seqaij 73 rows=60, cols=60 74 total: nonzeros=176, allocated nonzeros=176 75 total number of mallocs used during MatSetValues calls=0 76 not using I-node routines 77 Mat Object: 1 MPI processes 78 type: seqaij 79 rows=60, cols=60 80 total: nonzeros=176, allocated nonzeros=176 81 total number of mallocs used during MatSetValues calls=0 82 not using I-node routines 83