SNES Object: 1 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=24
  total number of function evaluations=7
  norm schedule ALWAYS
  SNESLineSearch Object:   1 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:   1 MPI processes
    type: fgmres
      GMRES: restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      GMRES: 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:   1 MPI processes
    type: mg
      MG: type is MULTIPLICATIVE, levels=3 cycles=v
        Cycles per PCApply=1
        Using Galerkin computed coarse grid matrices
    Coarse grid solver -- level -------------------------------
      KSP Object:      (mg_coarse_)       1 MPI processes
        type: preonly
        maximum iterations=1, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object:      (mg_coarse_)       1 MPI processes
        type: lu
          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.59172
            Factored matrix follows:
              Mat Object:               1 MPI processes
                type: seqaij
                rows=25, cols=25
                package used to perform factorization: petsc
                total: nonzeros=269, allocated nonzeros=269
                total number of mallocs used during MatSetValues calls =0
                  using I-node routines: found 17 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object:         1 MPI processes
          type: seqaij
          rows=25, cols=25
          total: nonzeros=169, allocated nonzeros=169
          total number of mallocs used during MatSetValues calls =0
            not using I-node routines
    Down solver (pre-smoother) on level 1 -------------------------------
      KSP Object:      (mg_levels_1_)       1 MPI processes
        type: chebyshev
          Chebyshev: eigenvalue estimates:  min = 0.0994518, max = 1.09397
          Chebyshev: eigenvalues estimated using gmres with translations  [0. 0.1; 0. 1.1]
          KSP Object:          (mg_levels_1_esteig_)           1 MPI processes
            type: gmres
              GMRES: restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
              GMRES: 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
        maximum iterations=2
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using nonzero initial guess
        using NONE norm type for convergence test
      PC Object:      (mg_levels_1_)       1 MPI processes
        type: sor
          SOR: type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
        linear system matrix = precond matrix:
        Mat Object:         1 MPI processes
          type: seqaij
          rows=81, cols=81
          total: nonzeros=625, allocated nonzeros=625
          total number of mallocs used during MatSetValues calls =0
            not using I-node routines
    Up solver (post-smoother) same as down solver (pre-smoother)
    Down solver (pre-smoother) on level 2 -------------------------------
      KSP Object:      (mg_levels_2_)       1 MPI processes
        type: chebyshev
          Chebyshev: eigenvalue estimates:  min = 0.0992655, max = 1.09192
          Chebyshev: eigenvalues estimated using gmres with translations  [0. 0.1; 0. 1.1]
          KSP Object:          (mg_levels_2_esteig_)           1 MPI processes
            type: gmres
              GMRES: restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
              GMRES: 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
        maximum iterations=2
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using nonzero initial guess
        using NONE norm type for convergence test
      PC Object:      (mg_levels_2_)       1 MPI processes
        type: sor
          SOR: type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
        linear system matrix = precond matrix:
        Mat Object:         1 MPI processes
          type: seqaij
          rows=289, cols=289
          total: nonzeros=1377, allocated nonzeros=1377
          total number of mallocs used during MatSetValues calls =0
            not using I-node routines
    Up solver (post-smoother) same as down solver (pre-smoother)
    linear system matrix = precond matrix:
    Mat Object:     1 MPI processes
      type: seqaij
      rows=289, cols=289
      total: nonzeros=1377, allocated nonzeros=1377
      total number of mallocs used during MatSetValues calls =0
        not using I-node routines
Number of SNES iterations = 6
Number of Linear iterations = 24
Average Linear its / SNES = 4.000000e+00
