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