xref: /petsc/src/snes/tutorials/output/ex5_2_alt.out (revision d5b43468fb8780a8feea140ccd6fa3e6a50411cc) !
1        0 SNES Function norm 0.995735
2        Linear solve converged due to CONVERGED_RTOL iterations 3
3        1 SNES Function norm 0.276938
4        Linear solve converged due to CONVERGED_RTOL iterations 3
5        2 SNES Function norm 0.00668684
6        Linear solve converged due to CONVERGED_RTOL iterations 3
7        3 SNES Function norm 4.6129e-06
8      0 SNES Function norm 0.0763977
9      Linear solve converged due to CONVERGED_RTOL iterations 2
10      1 SNES Function norm 2.68308e-05
11      Linear solve converged due to CONVERGED_RTOL iterations 2
12      2 SNES Function norm 1.90247e-08
13    0 SNES Function norm 0.0408394
14    Linear solve converged due to CONVERGED_RTOL iterations 2
15    1 SNES Function norm 9.09197e-07
16    Linear solve converged due to CONVERGED_RTOL iterations 2
17    2 SNES Function norm 3.74739e-08
18  0 SNES Function norm 0.021012
19  Linear solve converged due to CONVERGED_RTOL iterations 2
20  1 SNES Function norm 8.22296e-08
21SNES Object: 1 MPI process
22  type: newtonls
23  maximum iterations=50, maximum function evaluations=10000
24  tolerances: relative=1e-05, absolute=1e-25, solution=1e-05
25  total number of linear solver iterations=19
26  total number of function evaluations=12
27  norm schedule ALWAYS
28  total number of grid sequence refinements=3
29  Jacobian is built using a DMDA local Jacobian
30  SNESLineSearch Object: 1 MPI process
31    type: bt
32      interpolation: cubic
33      alpha=1.000000e-04
34    maxstep=1.000000e+08, minlambda=1.000000e-12
35    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
36    maximum iterations=40
37  KSP Object: 1 MPI process
38    type: gmres
39      restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
40      happy breakdown tolerance 1e-30
41    maximum iterations=10000, initial guess is zero
42    tolerances:  relative=1e-05, absolute=-1., divergence=10000.
43    left preconditioning
44    using PRECONDITIONED norm type for convergence test
45  PC Object: 1 MPI process
46    type: mg
47      type is FULL, levels=4 cycles=v
48        Using Galerkin computed coarse grid matrices for pmat
49    Coarse grid solver -- level 0 -------------------------------
50      KSP Object: (mg_coarse_) 1 MPI process
51        type: preonly
52        maximum iterations=10000, initial guess is zero
53        tolerances:  relative=1e-05, absolute=1e-25, divergence=10000.
54        left preconditioning
55        using NONE norm type for convergence test
56      PC Object: (mg_coarse_) 1 MPI process
57        type: lu
58          out-of-place factorization
59          tolerance for zero pivot 1.19209e-05
60          using diagonal shift on blocks to prevent zero pivot [INBLOCKS]
61          matrix ordering: nd
62          factor fill ratio given 5., needed 1.42
63            Factored matrix follows:
64              Mat Object: (mg_coarse_) 1 MPI process
65                type: seqaij
66                rows=16, cols=16
67                package used to perform factorization: petsc
68                total: nonzeros=142, allocated nonzeros=142
69                  using I-node routines: found 11 nodes, limit used is 5
70        linear system matrix = precond matrix:
71        Mat Object: 1 MPI process
72          type: seqaij
73          rows=16, cols=16
74          total: nonzeros=100, allocated nonzeros=100
75          total number of mallocs used during MatSetValues calls=0
76            not using I-node routines
77    Down solver (pre-smoother) on level 1 -------------------------------
78      KSP Object: (mg_levels_1_) 1 MPI process
79        type: chebyshev
80          eigenvalue targets used: min 0.569941, max 1.25387
81          eigenvalues estimated via gmres: min 0.381692, max 1.13988
82          eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1]
83          KSP Object: (mg_levels_1_esteig_) 1 MPI process
84            type: gmres
85              restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
86              happy breakdown tolerance 1e-30
87            maximum iterations=10, initial guess is zero
88            tolerances:  relative=1e-12, absolute=1e-25, divergence=10000.
89            left preconditioning
90            using PRECONDITIONED norm type for convergence test
91          estimating eigenvalues using noisy right hand side
92        maximum iterations=2, nonzero initial guess
93        tolerances:  relative=1e-05, absolute=1e-25, divergence=10000.
94        left preconditioning
95        using UNPRECONDITIONED norm type for convergence test
96      PC Object: (mg_levels_1_) 1 MPI process
97        type: sor
98          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
99        linear system matrix = precond matrix:
100        Mat Object: 1 MPI process
101          type: seqaij
102          rows=49, cols=49
103          total: nonzeros=361, allocated nonzeros=361
104          total number of mallocs used during MatSetValues calls=0
105            not using I-node routines
106    Up solver (post-smoother) same as down solver (pre-smoother)
107    Down solver (pre-smoother) on level 2 -------------------------------
108      KSP Object: (mg_levels_2_) 1 MPI process
109        type: chebyshev
110          eigenvalue targets used: min 0.498207, max 1.09606
111          eigenvalues estimated via gmres: min 0.113268, max 0.996415
112          eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1]
113          KSP Object: (mg_levels_2_esteig_) 1 MPI process
114            type: gmres
115              restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
116              happy breakdown tolerance 1e-30
117            maximum iterations=10, initial guess is zero
118            tolerances:  relative=1e-12, absolute=1e-25, divergence=10000.
119            left preconditioning
120            using PRECONDITIONED norm type for convergence test
121          estimating eigenvalues using noisy right hand side
122        maximum iterations=2, nonzero initial guess
123        tolerances:  relative=1e-05, absolute=1e-25, divergence=10000.
124        left preconditioning
125        using UNPRECONDITIONED norm type for convergence test
126      PC Object: (mg_levels_2_) 1 MPI process
127        type: sor
128          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
129        linear system matrix = precond matrix:
130        Mat Object: 1 MPI process
131          type: seqaij
132          rows=169, cols=169
133          total: nonzeros=1369, allocated nonzeros=1369
134          total number of mallocs used during MatSetValues calls=0
135            not using I-node routines
136    Up solver (post-smoother) same as down solver (pre-smoother)
137    Down solver (pre-smoother) on level 3 -------------------------------
138      KSP Object: (mg_levels_3_) 1 MPI process
139        type: chebyshev
140          eigenvalue targets used: min 0.498868, max 1.09751
141          eigenvalues estimated via gmres: min 0.0267908, max 0.997736
142          eigenvalues estimated using gmres with transform: [0. 0.5; 0. 1.1]
143          KSP Object: (mg_levels_3_esteig_) 1 MPI process
144            type: gmres
145              restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
146              happy breakdown tolerance 1e-30
147            maximum iterations=10, initial guess is zero
148            tolerances:  relative=1e-12, absolute=1e-25, divergence=10000.
149            left preconditioning
150            using PRECONDITIONED norm type for convergence test
151          estimating eigenvalues using noisy right hand side
152        maximum iterations=2, nonzero initial guess
153        tolerances:  relative=1e-05, absolute=1e-25, divergence=10000.
154        left preconditioning
155        using UNPRECONDITIONED norm type for convergence test
156      PC Object: (mg_levels_3_) 1 MPI process
157        type: sor
158          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
159        linear system matrix = precond matrix:
160        Mat Object: 1 MPI process
161          type: seqaij
162          rows=625, cols=625
163          total: nonzeros=3025, allocated nonzeros=3025
164          total number of mallocs used during MatSetValues calls=0
165            not using I-node routines
166    Up solver (post-smoother) same as down solver (pre-smoother)
167    linear system matrix = precond matrix:
168    Mat Object: 1 MPI process
169      type: seqaij
170      rows=625, cols=625
171      total: nonzeros=3025, allocated nonzeros=3025
172      total number of mallocs used during MatSetValues calls=0
173        not using I-node routines
174