xref: /petsc/src/ts/tutorials/output/ex3_3.out (revision c4762a1b19cd2af06abeed90e8f9d34fb975dd94)
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 Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
5*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
6*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
7*c4762a1bSJed BrownTimestep   1: step size = 0.000504055, time = 0.000143637, 2-norm error = 0.000290581, max norm error = 0.0004186
8*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
9*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
10*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
11*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
12*c4762a1bSJed BrownTimestep   2: step size = 0.000500257, time = 0.000647692, 2-norm error = 0.0010422, max norm error = 0.00150753
13*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
14*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
15*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
16*c4762a1bSJed Brown    Linear solve converged due to CONVERGED_RTOL iterations 1
17*c4762a1bSJed BrownTimestep   3: step size = 0.000526001, time = 0.00114795, 2-norm error = 0.0015392, max norm error = 0.0022348
18*c4762a1bSJed Brownavg. error (2 norm) = 0.000957327, avg. error (max norm) = 0.00138698
19*c4762a1bSJed BrownTS Object: 1 MPI processes
20*c4762a1bSJed Brown  type: rosw
21*c4762a1bSJed Brown    Rosenbrock-W ra34pw2
22*c4762a1bSJed Brown    Abscissa of A       =  0.000000  0.871733  0.731580  1.000000
23*c4762a1bSJed Brown    Abscissa of A+Gamma =  0.435867  0.871733  0.731580  1.000000
24*c4762a1bSJed Brown  maximum steps=3
25*c4762a1bSJed Brown  maximum time=100.
26*c4762a1bSJed Brown  total number of linear solver iterations=12
27*c4762a1bSJed Brown  total number of linear solve failures=0
28*c4762a1bSJed Brown  total number of rejected steps=0
29*c4762a1bSJed Brown  using relative error tolerance of 0.0001,   using absolute error tolerance of 0.0001
30*c4762a1bSJed Brown  TSAdapt Object: 1 MPI processes
31*c4762a1bSJed Brown    type: basic
32*c4762a1bSJed Brown    safety factor 0.9
33*c4762a1bSJed Brown    extra safety factor after step rejection 0.5
34*c4762a1bSJed Brown    clip fastest increase 10.
35*c4762a1bSJed Brown    clip fastest decrease 0.1
36*c4762a1bSJed Brown    maximum allowed timestep 1e+20
37*c4762a1bSJed Brown    minimum allowed timestep 1e-20
38*c4762a1bSJed Brown    maximum solution absolute value to be ignored -1.
39*c4762a1bSJed Brown  SNES Object: 1 MPI processes
40*c4762a1bSJed Brown    type: ksponly
41*c4762a1bSJed Brown    maximum iterations=50, maximum function evaluations=10000
42*c4762a1bSJed Brown    tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
43*c4762a1bSJed Brown    total number of linear solver iterations=1
44*c4762a1bSJed Brown    total number of function evaluations=1
45*c4762a1bSJed Brown    norm schedule ALWAYS
46*c4762a1bSJed Brown    Jacobian is never rebuilt
47*c4762a1bSJed Brown    KSP Object: 1 MPI processes
48*c4762a1bSJed Brown      type: gmres
49*c4762a1bSJed Brown        restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
50*c4762a1bSJed Brown        happy breakdown tolerance 1e-30
51*c4762a1bSJed Brown      maximum iterations=10000, initial guess is zero
52*c4762a1bSJed Brown      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
53*c4762a1bSJed Brown      left preconditioning
54*c4762a1bSJed Brown      using PRECONDITIONED norm type for convergence test
55*c4762a1bSJed Brown    PC Object: 1 MPI processes
56*c4762a1bSJed Brown      type: ilu
57*c4762a1bSJed Brown        out-of-place factorization
58*c4762a1bSJed Brown        0 levels of fill
59*c4762a1bSJed Brown        tolerance for zero pivot 2.22045e-14
60*c4762a1bSJed Brown        matrix ordering: natural
61*c4762a1bSJed Brown        factor fill ratio given 1., needed 1.
62*c4762a1bSJed Brown          Factored matrix follows:
63*c4762a1bSJed Brown            Mat Object: 1 MPI processes
64*c4762a1bSJed Brown              type: seqaij
65*c4762a1bSJed Brown              rows=60, cols=60
66*c4762a1bSJed Brown              package used to perform factorization: petsc
67*c4762a1bSJed Brown              total: nonzeros=176, allocated nonzeros=176
68*c4762a1bSJed Brown              total number of mallocs used during MatSetValues calls=0
69*c4762a1bSJed Brown                not using I-node routines
70*c4762a1bSJed Brown      linear system matrix followed by preconditioner matrix:
71*c4762a1bSJed Brown      Mat Object: 1 MPI processes
72*c4762a1bSJed Brown        type: seqaij
73*c4762a1bSJed Brown        rows=60, cols=60
74*c4762a1bSJed Brown        total: nonzeros=176, allocated nonzeros=176
75*c4762a1bSJed Brown        total number of mallocs used during MatSetValues calls=0
76*c4762a1bSJed Brown          not using I-node routines
77*c4762a1bSJed Brown      Mat Object: 1 MPI processes
78*c4762a1bSJed Brown        type: seqaij
79*c4762a1bSJed Brown        rows=60, cols=60
80*c4762a1bSJed Brown        total: nonzeros=176, allocated nonzeros=176
81*c4762a1bSJed Brown        total number of mallocs used during MatSetValues calls=0
82*c4762a1bSJed Brown          not using I-node routines
83