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