1*c4762a1bSJed BrownSolving a linear TS problem on 1 processor 2*c4762a1bSJed BrownTimestep 0: step size = 0.000143637, time = 0., 2-norm error = 0., max norm error = 0. 3*c4762a1bSJed Brown Linear solve converged due to CONVERGED_RTOL iterations 1 4*c4762a1bSJed BrownTimestep 1: step size = 0.000143637, time = 0.000143637, 2-norm error = 0.00112483, max norm error = 0.00162124 5*c4762a1bSJed Brown Linear solve converged due to CONVERGED_RTOL iterations 1 6*c4762a1bSJed BrownTimestep 2: step size = 0.000143637, time = 0.000287274, 2-norm error = 0.00213968, max norm error = 0.00308653 7*c4762a1bSJed Brown Linear solve converged due to CONVERGED_RTOL iterations 1 8*c4762a1bSJed BrownTimestep 3: step size = 0.000143637, time = 0.000430911, 2-norm error = 0.00305264, max norm error = 0.0044073 9*c4762a1bSJed Brownavg. error (2 norm) = 0.00210572, avg. error (max norm) = 0.00303835 10*c4762a1bSJed BrownTS Object: 1 MPI processes 11*c4762a1bSJed Brown type: beuler 12*c4762a1bSJed Brown maximum steps=3 13*c4762a1bSJed Brown maximum time=100. 14*c4762a1bSJed Brown total number of linear solver iterations=3 15*c4762a1bSJed Brown total number of linear solve failures=0 16*c4762a1bSJed Brown total number of rejected steps=0 17*c4762a1bSJed Brown using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 18*c4762a1bSJed Brown TSAdapt Object: 1 MPI processes 19*c4762a1bSJed Brown type: none 20*c4762a1bSJed Brown SNES Object: 1 MPI processes 21*c4762a1bSJed Brown type: ksponly 22*c4762a1bSJed Brown maximum iterations=50, maximum function evaluations=10000 23*c4762a1bSJed Brown tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 24*c4762a1bSJed Brown total number of linear solver iterations=1 25*c4762a1bSJed Brown total number of function evaluations=1 26*c4762a1bSJed Brown norm schedule ALWAYS 27*c4762a1bSJed Brown KSP Object: 1 MPI processes 28*c4762a1bSJed Brown type: gmres 29*c4762a1bSJed Brown restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 30*c4762a1bSJed Brown happy breakdown tolerance 1e-30 31*c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 32*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 33*c4762a1bSJed Brown left preconditioning 34*c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 35*c4762a1bSJed Brown PC Object: 1 MPI processes 36*c4762a1bSJed Brown type: ilu 37*c4762a1bSJed Brown out-of-place factorization 38*c4762a1bSJed Brown 0 levels of fill 39*c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 40*c4762a1bSJed Brown matrix ordering: natural 41*c4762a1bSJed Brown factor fill ratio given 1., needed 1. 42*c4762a1bSJed Brown Factored matrix follows: 43*c4762a1bSJed Brown Mat Object: 1 MPI processes 44*c4762a1bSJed Brown type: seqaij 45*c4762a1bSJed Brown rows=60, cols=60 46*c4762a1bSJed Brown package used to perform factorization: petsc 47*c4762a1bSJed Brown total: nonzeros=176, allocated nonzeros=176 48*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 49*c4762a1bSJed Brown not using I-node routines 50*c4762a1bSJed Brown linear system matrix = precond matrix: 51*c4762a1bSJed Brown Mat Object: 1 MPI processes 52*c4762a1bSJed Brown type: seqaij 53*c4762a1bSJed Brown rows=60, cols=60 54*c4762a1bSJed Brown total: nonzeros=176, allocated nonzeros=300 55*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 56*c4762a1bSJed Brown not using I-node routines 57