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