lid velocity = 200., prandtl # = 1., grashof # = 10000.
      0 SNES Function norm 2240.15
      1 SNES Function norm 0.590311
      2 SNES Function norm 5.84955e-06
    Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 2
    0 SNES Function norm 3455.4
    1 SNES Function norm 201221.
    2 SNES Function norm 2.47608e+09
  Nonlinear solve did not converge due to DIVERGED_DTOL iterations 2
  SNES Object: 2 MPI processes
    type: ngmres
      Number of stored past updates: 30
      Residual selection: gammaA=2e+00, gammaC=2e+00
      Difference restart: epsilonB=1e-01, deltaB=9e-01
      Restart on F_M residual increase: FALSE
    maximum iterations=10000, maximum function evaluations=30000
    tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
    total number of function evaluations=3
    norm schedule ALWAYS
    total number of grid sequence refinements=2
    Jacobian is built using a DMDA local Jacobian
    SNESLineSearch Object: 2 MPI processes
      type: basic
      maxstep=1.000000e+08, minlambda=1.000000e-12
      tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
      maximum iterations=1
    SNES Object: (npc_) 2 MPI processes
      type: fas
        type is MULTIPLICATIVE, levels=2, cycles=1
        Not using Galerkin computed coarse grid function evaluation
        Coarse grid solver -- level 0 -------------------------------
        SNES Object: (npc_fas_coarse_) 2 MPI processes
          type: newtonls
          maximum iterations=50, maximum function evaluations=10000
          tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
          total number of linear solver iterations=8
          total number of function evaluations=43
          norm schedule ALWAYS
          Jacobian is built using colored finite differences on a DMDA
          SNESLineSearch Object: (npc_fas_coarse_) 2 MPI processes
            type: bt
              interpolation: cubic
              alpha=1.000000e-04
            maxstep=1.000000e+08, minlambda=1.000000e-12
            tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
            maximum iterations=40
          KSP Object: (npc_fas_coarse_) 2 MPI processes
            type: preonly
            maximum iterations=10000, initial guess is zero
            tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
            left preconditioning
            using NONE norm type for convergence test
          PC Object: (npc_fas_coarse_) 2 MPI processes
            type: bjacobi
              number of blocks = 2
              Local solver information for first block is in the following KSP and PC objects on rank 0:
              Use -npc_fas_coarse_ksp_view ::ascii_info_detail to display information for all blocks
            KSP Object: (npc_fas_coarse_sub_) 1 MPI process
              type: preonly
              maximum iterations=10000, initial guess is zero
              tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
              left preconditioning
              using NONE norm type for convergence test
            PC Object: (npc_fas_coarse_sub_) 1 MPI process
              type: ilu
                out-of-place factorization
                0 levels of fill
                tolerance for zero pivot 2.22045e-14
                matrix ordering: natural
                factor fill ratio given 1., needed 1.
                  Factored matrix follows:
                    Mat Object: (npc_fas_coarse_sub_) 1 MPI process
                      type: seqaij
                      rows=32, cols=32, bs=4
                      package used to perform factorization: petsc
                      total: nonzeros=448, allocated nonzeros=448
                        using I-node routines: found 8 nodes, limit used is 5
              linear system matrix = precond matrix:
              Mat Object: (npc_fas_coarse_sub_) 1 MPI process
                type: seqaij
                rows=32, cols=32, bs=4
                total: nonzeros=448, allocated nonzeros=448
                total number of mallocs used during MatSetValues calls=0
                  using I-node routines: found 8 nodes, limit used is 5
            linear system matrix = precond matrix:
            Mat Object: 2 MPI processes
              type: mpiaij
              rows=64, cols=64, bs=4
              total: nonzeros=1024, allocated nonzeros=1024
              total number of mallocs used during MatSetValues calls=0
        Down solver (pre-smoother) on level 1 -------------------------------
        SNES Object: (npc_fas_levels_1_) 2 MPI processes
          type: nrichardson
          maximum iterations=1, maximum function evaluations=30000
          tolerances: relative=0., absolute=0., solution=0.
          total number of function evaluations=4
          norm schedule FINALONLY
          Jacobian is built using a DMDA local Jacobian
          SNESLineSearch Object: (npc_fas_levels_1_) 2 MPI processes
            type: l2
            maxstep=1.000000e+08, minlambda=1.000000e-12
            tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
            maximum iterations=1
        Up solver (post-smoother) same as down solver (pre-smoother)
      maximum iterations=1, maximum function evaluations=30000
      tolerances: relative=0., absolute=0., solution=0.
      total number of function evaluations=0
      norm schedule FINALONLY
      Jacobian is built using a DMDA local Jacobian
Number of SNES iterations = 2
