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