xref: /petsc/src/snes/tutorials/output/ex40f90_1.out (revision d52a580b706c59ca78066c1e38754e45b6b56e2b)
1  0 SNES Function norm 26.8701
2  1 SNES Function norm 6.71751
3  2 SNES Function norm 0.186598
4  3 SNES Function norm 0.000161417
5  4 SNES Function norm 1.212e-10
6SNES Object: 1 MPI process
7  type: newtonls
8  maximum iterations=50, maximum function evaluations=10000
9  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
10  total number of linear solver iterations=4
11  total number of function evaluations=5
12  norm schedule ALWAYS
13  Jacobian is built using colored finite differences on a DMDA
14  SNESLineSearch Object: 1 MPI process
15    type: bt
16      interpolation: cubic
17      alpha=1.000000e-04
18    maxlambda=1.000000e+00, minlambda=1.000000e-12
19    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
20    maximum iterations=40
21  KSP Object: 1 MPI process
22    type: fgmres
23      restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement
24      happy breakdown tolerance=1e-30
25    maximum iterations=10000, initial guess is zero
26    tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
27    right preconditioning
28    using UNPRECONDITIONED norm type for convergence test
29  PC Object: 1 MPI process
30    type: mg
31      type is FULL, levels=2 cycles=v
32        Using Galerkin computed coarse grid matrices for pmat
33    Coarse grid solver -- level 0 -------------------------------
34      KSP Object: (mg_coarse_) 1 MPI process
35        type: preonly
36        maximum iterations=10000, initial guess is zero
37        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
38        left preconditioning
39        not checking for convergence
40      PC Object: (mg_coarse_) 1 MPI process
41        type: lu
42          out-of-place factorization
43          tolerance for zero pivot 2.22045e-14
44          using diagonal shift on blocks to prevent zero pivot [INBLOCKS]
45          matrix ordering: nd
46          factor fill ratio given 5., needed 2.38265
47            Factored matrix:
48              Mat Object: (mg_coarse_) 1 MPI process
49                type: seqaij
50                rows=200, cols=200, bs=2
51                package used to perform factorization: petsc
52                total: nonzeros=7472, allocated nonzeros=7472
53                  using I-node routines: found 82 nodes, limit used is 5
54        linear system matrix, which is also used to construct the preconditioner:
55        Mat Object: 1 MPI process
56          type: seqaij
57          rows=200, cols=200, bs=2
58          total: nonzeros=3136, allocated nonzeros=3136
59          total number of mallocs used during MatSetValues calls=0
60            using I-node routines: found 100 nodes, limit used is 5
61    Down solver (pre-smoother) on level 1 -------------------------------
62      KSP Object: (mg_levels_1_) 1 MPI process
63        type: chebyshev
64          Chebyshev polynomial of first kind
65          eigenvalue targets used: min 0.1, max 1.1
66          eigenvalues estimated via gmres: min 1., max 1.
67          eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1]
68          KSP Object: (mg_levels_1_esteig_) 1 MPI process
69            type: gmres
70              restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement
71              happy breakdown tolerance=1e-30
72            maximum iterations=10, initial guess is zero
73            tolerances: relative=1e-12, absolute=1e-50, divergence=10000.
74            left preconditioning
75            using PRECONDITIONED norm type for convergence test
76          estimating eigenvalues using a noisy random number generated right-hand side
77        maximum iterations=2, nonzero initial guess
78        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
79        left preconditioning
80        not checking for convergence
81      PC Object: (mg_levels_1_) 1 MPI process
82        type: sor
83          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
84        linear system matrix, which is also used to construct the preconditioner:
85        Mat Object: 1 MPI process
86          type: seqaij
87          rows=722, cols=722, bs=2
88          total: nonzeros=12100, allocated nonzeros=12100
89          total number of mallocs used during MatSetValues calls=0
90            using I-node routines: found 361 nodes, limit used is 5
91    Up solver (post-smoother) same as down solver (pre-smoother)
92    linear system matrix, which is also used to construct the preconditioner:
93    Mat Object: 1 MPI process
94      type: seqaij
95      rows=722, cols=722, bs=2
96      total: nonzeros=12100, allocated nonzeros=12100
97      total number of mallocs used during MatSetValues calls=0
98        using I-node routines: found 361 nodes, limit used is 5
99