1f7f07198SBarry SmithTS Object: 1 MPI processes 2f7f07198SBarry Smith type: rosw 3f7f07198SBarry Smith Rosenbrock-W ra34pw2 4f7f07198SBarry Smith Abscissa of A = 0.000000 0.871733 0.731580 1.000000 5f7f07198SBarry Smith Abscissa of A+Gamma = 0.435867 0.871733 0.731580 1.000000 6f7f07198SBarry Smith maximum time=1. 7*a6ab3590SBarry Smith total number of I function evaluations=256 8*a6ab3590SBarry Smith total number of RHS function evaluations=256 9f7f07198SBarry Smith total number of nonlinear solver iterations=64 10f7f07198SBarry Smith total number of linear solver iterations=64 11f7f07198SBarry Smith total number of linear solve failures=0 12f7f07198SBarry Smith total number of rejected steps=1 13f7f07198SBarry Smith using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 14f7f07198SBarry Smith TSAdapt Object: 1 MPI processes 15f7f07198SBarry Smith type: basic 16f7f07198SBarry Smith safety factor 0.9 17f7f07198SBarry Smith extra safety factor after step rejection 0.5 18f7f07198SBarry Smith clip fastest increase 10. 19f7f07198SBarry Smith clip fastest decrease 0.1 20f7f07198SBarry Smith maximum allowed timestep 1e+20 21f7f07198SBarry Smith minimum allowed timestep 1e-20 22f7f07198SBarry Smith maximum solution absolute value to be ignored -1. 23f7f07198SBarry Smith SNES Object: 1 MPI processes 24f7f07198SBarry Smith type: ksponly 25f7f07198SBarry Smith maximum iterations=50, maximum function evaluations=10000 26f7f07198SBarry Smith tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 27f7f07198SBarry Smith total number of linear solver iterations=1 28f7f07198SBarry Smith total number of function evaluations=4 29f7f07198SBarry Smith norm schedule ALWAYS 30f7f07198SBarry Smith Jacobian is rebuilt every 2 SNES iterations 31f7f07198SBarry Smith Jacobian is built using finite differences one column at a time 32f7f07198SBarry Smith KSP Object: 1 MPI processes 33f7f07198SBarry Smith type: gmres 34f7f07198SBarry Smith restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 35f7f07198SBarry Smith happy breakdown tolerance 1e-30 36f7f07198SBarry Smith maximum iterations=10000, initial guess is zero 37f7f07198SBarry Smith tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 38f7f07198SBarry Smith left preconditioning 39f7f07198SBarry Smith using PRECONDITIONED norm type for convergence test 40f7f07198SBarry Smith PC Object: 1 MPI processes 41f7f07198SBarry Smith type: ilu 42f7f07198SBarry Smith out-of-place factorization 43f7f07198SBarry Smith 0 levels of fill 44f7f07198SBarry Smith tolerance for zero pivot 2.22045e-14 45f7f07198SBarry Smith matrix ordering: external 46f7f07198SBarry Smith factor fill ratio given 0., needed 0. 47f7f07198SBarry Smith Factored matrix follows: 48f7f07198SBarry Smith Mat Object: 1 MPI processes 49f7f07198SBarry Smith type: seqdense 50f7f07198SBarry Smith rows=2, cols=2 51f7f07198SBarry Smith package used to perform factorization: petsc 52f7f07198SBarry Smith total: nonzeros=4, allocated nonzeros=4 53f7f07198SBarry Smith linear system matrix = precond matrix: 54f7f07198SBarry Smith Mat Object: 1 MPI processes 55f7f07198SBarry Smith type: seqdense 56f7f07198SBarry Smith rows=2, cols=2 57f7f07198SBarry Smith total: nonzeros=4, allocated nonzeros=4 58f7f07198SBarry Smith total number of mallocs used during MatSetValues calls=0 59