0 SNES Function norm 0.252383
  1 SNES Function norm 0.0738456
  2 SNES Function norm 0.0155009
  3 SNES Function norm 0.000871577
  4 SNES Function norm 1.96312e-06
  5 SNES Function norm 1.029e-11
SNES Object: 4 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=20
  total number of function evaluations=6
  norm schedule ALWAYS
  SNESLineSearch Object: 4 MPI processes
    type: bt
      interpolation: cubic
      alpha=1.000000e-04
    maxlambda=1.000000e+00, minlambda=1.000000e-12
    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
    maximum iterations=40
  KSP Object: 4 MPI processes
    type: fgmres
      restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement
      happy breakdown tolerance=1e-30
    maximum iterations=10000, initial guess is zero
    tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
    right preconditioning
    using UNPRECONDITIONED norm type for convergence test
  PC Object: 4 MPI processes
    type: mg
      type is FULL, levels=2 cycles=v
        Using Galerkin computed coarse grid matrices for pmat
    Coarse grid solver -- level 0 -------------------------------
      KSP Object: (mg_coarse_) 4 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        not checking for convergence
      PC Object: (mg_coarse_) 4 MPI processes
        type: redundant
          First (color=0) of 4 PCs follows
          KSP Object: (mg_coarse_redundant_) 1 MPI process
            type: preonly
            maximum iterations=10000, initial guess is zero
            tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
            left preconditioning
            not checking for convergence
          PC Object: (mg_coarse_redundant_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              using diagonal shift on blocks to prevent zero pivot [INBLOCKS]
              matrix ordering: nd
              factor fill ratio given 5., needed 1.19825
                Factored matrix:
                  Mat Object: (mg_coarse_redundant_) 1 MPI process
                    type: seqaij
                    rows=27, cols=27
                    package used to perform factorization: petsc
                    total: nonzeros=411, allocated nonzeros=411
                      not using I-node routines
            linear system matrix, which is also used to construct the preconditioner:
            Mat Object: 1 MPI process
              type: seqaij
              rows=27, cols=27
              total: nonzeros=343, allocated nonzeros=343
              total number of mallocs used during MatSetValues calls=0
                not using I-node routines
        linear system matrix, which is also used to construct the preconditioner:
        Mat Object: 4 MPI processes
          type: mpiaij
          rows=27, cols=27
          total: nonzeros=343, allocated nonzeros=343
          total number of mallocs used during MatSetValues calls=0
            using nonscalable MatPtAP() implementation
            not using I-node (on process 0) routines
    Down solver (pre-smoother) on level 1 -------------------------------
      KSP Object: (mg_levels_1_) 4 MPI processes
        type: chebyshev
          Chebyshev polynomial of first kind
          eigenvalue targets used: min 0.138238, max 1.52061
          eigenvalues estimated via gmres: min 0.118037, max 1.38238
          eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1]
          KSP Object: (mg_levels_1_esteig_) 4 MPI processes
            type: gmres
              restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement
              happy breakdown tolerance=1e-30
            maximum iterations=10, initial guess is zero
            tolerances: relative=1e-12, absolute=1e-50, divergence=10000.
            left preconditioning
            using PRECONDITIONED norm type for convergence test
          estimating eigenvalues using a noisy random number generated right-hand side
        maximum iterations=2, nonzero initial guess
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        not checking for convergence
      PC Object: (mg_levels_1_) 4 MPI processes
        type: sor
          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
        linear system matrix, which is also used to construct the preconditioner:
        Mat Object: 4 MPI processes
          type: mpiaij
          rows=125, cols=125
          total: nonzeros=725, allocated nonzeros=725
          total number of mallocs used during MatSetValues calls=0
    Up solver (post-smoother) same as down solver (pre-smoother)
    linear system matrix, which is also used to construct the preconditioner:
    Mat Object: 4 MPI processes
      type: mpiaij
      rows=125, cols=125
      total: nonzeros=725, allocated nonzeros=725
      total number of mallocs used during MatSetValues calls=0
Number of SNES iterations = 5
Number of Linear iterations = 20
Average Linear its / SNES = 4.000000e+00