xref: /petsc/src/snes/tutorials/output/ex19_ngmres_fas_ms.out (revision f13dfd9ea68e0ddeee984e65c377a1819eab8a8a)
1lid velocity = 200., prandtl # = 1., grashof # = 10000.
2      0 SNES Function norm 2240.15
3      1 SNES Function norm 0.590311
4      2 SNES Function norm 5.84955e-06
5    Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 2
6    0 SNES Function norm 3455.4
7    1 SNES Function norm 201221.
8    2 SNES Function norm 2.47608e+09
9  Nonlinear solve did not converge due to DIVERGED_DTOL iterations 2
10  SNES Object: 2 MPI processes
11    type: ngmres
12      Number of stored past updates: 30
13      Residual selection: gammaA=2e+00, gammaC=2e+00
14      Difference restart: epsilonB=1e-01, deltaB=9e-01
15      Restart on F_M residual increase: FALSE
16    maximum iterations=10000, maximum function evaluations=30000
17    tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
18    total number of function evaluations=3
19    norm schedule ALWAYS
20    total number of grid sequence refinements=2
21    Jacobian is built using a DMDA local Jacobian
22    SNESLineSearch Object: 2 MPI processes
23      type: basic
24      maxstep=1.000000e+08, minlambda=1.000000e-12
25      tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
26      maximum iterations=1
27    SNES Object: (npc_) 2 MPI processes
28      type: fas
29        type is MULTIPLICATIVE, levels=2, cycles=1
30        Not using Galerkin computed coarse grid function evaluation
31        Coarse grid solver -- level 0 -------------------------------
32        SNES Object: (npc_fas_coarse_) 2 MPI processes
33          type: newtonls
34          maximum iterations=50, maximum function evaluations=10000
35          tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
36          total number of linear solver iterations=8
37          total number of function evaluations=43
38          norm schedule ALWAYS
39          Jacobian is built using colored finite differences on a DMDA
40          SNESLineSearch Object: (npc_fas_coarse_) 2 MPI processes
41            type: bt
42              interpolation: cubic
43              alpha=1.000000e-04
44            maxstep=1.000000e+08, minlambda=1.000000e-12
45            tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
46            maximum iterations=40
47          KSP Object: (npc_fas_coarse_) 2 MPI processes
48            type: preonly
49            maximum iterations=10000, initial guess is zero
50            tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
51            left preconditioning
52            using NONE norm type for convergence test
53          PC Object: (npc_fas_coarse_) 2 MPI processes
54            type: bjacobi
55              number of blocks = 2
56              Local solver information for first block is in the following KSP and PC objects on rank 0:
57              Use -npc_fas_coarse_ksp_view ::ascii_info_detail to display information for all blocks
58            KSP Object: (npc_fas_coarse_sub_) 1 MPI process
59              type: preonly
60              maximum iterations=10000, initial guess is zero
61              tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
62              left preconditioning
63              using NONE norm type for convergence test
64            PC Object: (npc_fas_coarse_sub_) 1 MPI process
65              type: ilu
66                out-of-place factorization
67                0 levels of fill
68                tolerance for zero pivot 2.22045e-14
69                matrix ordering: natural
70                factor fill ratio given 1., needed 1.
71                  Factored matrix follows:
72                    Mat Object: (npc_fas_coarse_sub_) 1 MPI process
73                      type: seqaij
74                      rows=32, cols=32, bs=4
75                      package used to perform factorization: petsc
76                      total: nonzeros=448, allocated nonzeros=448
77                        using I-node routines: found 8 nodes, limit used is 5
78              linear system matrix = precond matrix:
79              Mat Object: (npc_fas_coarse_sub_) 1 MPI process
80                type: seqaij
81                rows=32, cols=32, bs=4
82                total: nonzeros=448, allocated nonzeros=448
83                total number of mallocs used during MatSetValues calls=0
84                  using I-node routines: found 8 nodes, limit used is 5
85            linear system matrix = precond matrix:
86            Mat Object: 2 MPI processes
87              type: mpiaij
88              rows=64, cols=64, bs=4
89              total: nonzeros=1024, allocated nonzeros=1024
90              total number of mallocs used during MatSetValues calls=0
91        Down solver (pre-smoother) on level 1 -------------------------------
92        SNES Object: (npc_fas_levels_1_) 2 MPI processes
93          type: nrichardson
94          maximum iterations=1, maximum function evaluations=30000
95          tolerances: relative=0., absolute=0., solution=0.
96          total number of function evaluations=4
97          norm schedule FINALONLY
98          Jacobian is built using a DMDA local Jacobian
99          SNESLineSearch Object: (npc_fas_levels_1_) 2 MPI processes
100            type: l2
101            maxstep=1.000000e+08, minlambda=1.000000e-12
102            tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
103            maximum iterations=1
104        Up solver (post-smoother) same as down solver (pre-smoother)
105      maximum iterations=1, maximum function evaluations=30000
106      tolerances: relative=0., absolute=0., solution=0.
107      total number of function evaluations=0
108      norm schedule FINALONLY
109      Jacobian is built using a DMDA local Jacobian
110Number of SNES iterations = 2
111