1lid velocity = 0.0625, prandtl # = 1., grashof # = 1.
2  0 SNES Function norm 2.391552133017e-01
3    0 KSP Residual norm 2.487202582099e-01
4    1 KSP Residual norm 2.061836020657e-02
5    2 KSP Residual norm 5.209414702046e-03
6    3 KSP Residual norm 1.568272395677e-03
7    4 KSP Residual norm 3.295627866513e-04
8    5 KSP Residual norm 9.155694279372e-05
9    6 KSP Residual norm 3.446349799027e-05
10    7 KSP Residual norm 7.611368243653e-06
11    8 KSP Residual norm 2.122390430419e-06
12  1 SNES Function norm 6.848107477293e-05
13    0 KSP Residual norm 2.038292834185e-05
14    1 KSP Residual norm 5.930353180150e-06
15    2 KSP Residual norm 9.461586866971e-07
16    3 KSP Residual norm 3.023548973492e-07
17    4 KSP Residual norm 8.500626673260e-08
18    5 KSP Residual norm 1.686734638740e-08
19    6 KSP Residual norm 4.802448278829e-09
20    7 KSP Residual norm 1.753962559544e-09
21    8 KSP Residual norm 3.745101287855e-10
22    9 KSP Residual norm 1.072508427565e-10
23  2 SNES Function norm 2.138743891290e-10
24SNES Object: 2 MPI processes
25  type: newtonls
26  maximum iterations=50, maximum function evaluations=10000
27  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
28  total number of linear solver iterations=17
29  total number of function evaluations=3
30  norm schedule ALWAYS
31  Jacobian is built using colored finite differences on a DMDA
32  SNESLineSearch Object: 2 MPI processes
33    type: bt
34      interpolation: cubic
35      alpha=1.000000e-04
36    maxstep=1.000000e+08, minlambda=1.000000e-12
37    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
38    maximum iterations=40
39  KSP Object: 2 MPI processes
40    type: gmres
41      restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
42      happy breakdown tolerance 1e-30
43    maximum iterations=10000, initial guess is zero
44    tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
45    left preconditioning
46    using PRECONDITIONED norm type for convergence test
47  PC Object: 2 MPI processes
48    type: bjacobi
49      number of blocks = 2
50      Local solver is the same for all blocks, as in the following KSP and PC objects on rank 0:
51    KSP Object: (sub_) 1 MPI processes
52      type: preonly
53      maximum iterations=10000, initial guess is zero
54      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
55      left preconditioning
56      using NONE norm type for convergence test
57    PC Object: (sub_) 1 MPI processes
58      type: ilu
59        out-of-place factorization
60        0 levels of fill
61        tolerance for zero pivot 2.22045e-14
62        matrix ordering: natural
63        factor fill ratio given 1., needed 1.
64          Factored matrix follows:
65            Mat Object: 1 MPI processes
66              type: seqbaij
67              rows=32, cols=32, bs=4
68              package used to perform factorization: petsc
69              total: nonzeros=448, allocated nonzeros=448
70                  block size is 4
71      linear system matrix = precond matrix:
72      Mat Object: 1 MPI processes
73        type: seqbaij
74        rows=32, cols=32, bs=4
75        total: nonzeros=448, allocated nonzeros=448
76        total number of mallocs used during MatSetValues calls=0
77            block size is 4
78    linear system matrix = precond matrix:
79    Mat Object: 2 MPI processes
80      type: mpibaij
81      rows=64, cols=64, bs=4
82      total: nonzeros=1024, allocated nonzeros=1024
83      total number of mallocs used during MatSetValues calls=0
84Number of SNES iterations = 2
85