    Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 4
  Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 3
Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 3
SNES Object: 2 MPI processes
  type: newtonls
  maximum iterations=50, maximum function evaluations=10000
  tolerances: relative=1e-08, absolute=-1., solution=1e-08
  total number of linear solver iterations=29
  total number of function evaluations=267
  norm schedule ALWAYS
  total number of grid sequence refinements=2
  SNESLineSearch Object:   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:   2 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=10000, initial guess is zero
    tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object:   2 MPI processes
    type: mg
      MG: type is MULTIPLICATIVE, levels=3 cycles=v
        Cycles per PCApply=1
        Not using Galerkin computed coarse grid matrices
    Coarse grid solver -- level -------------------------------
      KSP Object:      (mg_coarse_)       2 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_)       2 MPI processes
        type: redundant
          Redundant preconditioner: First (color=0) of 2 PCs follows
          KSP Object:          (mg_coarse_redundant_)           1 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:          (mg_coarse_redundant_)           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.875
                Factored matrix follows:
                  Mat Object:                   1 MPI processes
                    type: seqaij
                    rows=16, cols=16
                    package used to perform factorization: petsc
                    total: nonzeros=120, allocated nonzeros=120
                    total number of mallocs used during MatSetValues calls =0
                      using I-node routines: found 12 nodes, limit used is 5
            linear system matrix = precond matrix:
            Mat Object:             1 MPI processes
              type: seqaij
              rows=16, cols=16
              total: nonzeros=64, allocated nonzeros=64
              total number of mallocs used during MatSetValues calls =0
                not using I-node routines
        linear system matrix = precond matrix:
        Mat Object:         2 MPI processes
          type: mpiaij
          rows=16, cols=16
          total: nonzeros=64, allocated nonzeros=64
          total number of mallocs used during MatSetValues calls =0
    Down solver (pre-smoother) on level 1 -------------------------------
      KSP Object:      (mg_levels_1_)       2 MPI processes
        type: chebyshev
          Chebyshev: eigenvalue estimates:  min = 0.129643, max = 1.42607
          Chebyshev: eigenvalues estimated using gmres with translations  [0. 0.1; 0. 1.1]
          KSP Object:          (mg_levels_1_esteig_)           2 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_)       2 MPI processes
        type: sor
          SOR: type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
        linear system matrix = precond matrix:
        Mat Object:         2 MPI processes
          type: mpiaij
          rows=49, cols=49
          total: nonzeros=217, allocated nonzeros=217
          total number of mallocs used during MatSetValues calls =0
    Up solver (post-smoother) same as down solver (pre-smoother)
    Down solver (pre-smoother) on level 2 -------------------------------
      KSP Object:      (mg_levels_2_)       2 MPI processes
        type: chebyshev
          Chebyshev: eigenvalue estimates:  min = 0.127794, max = 1.40574
          Chebyshev: eigenvalues estimated using gmres with translations  [0. 0.1; 0. 1.1]
          KSP Object:          (mg_levels_2_esteig_)           2 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_)       2 MPI processes
        type: sor
          SOR: type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
        linear system matrix followed by preconditioner matrix:
        Mat Object:         2 MPI processes
          type: mffd
          rows=169, cols=169
            Matrix-free approximation:
              err=1.49012e-08 (relative error in function evaluation)
              Using wp compute h routine
                  Does not compute normU
        Mat Object:         2 MPI processes
          type: mpiaij
          rows=169, cols=169
          total: nonzeros=793, allocated nonzeros=793
          total number of mallocs used during MatSetValues calls =0
    Up solver (post-smoother) same as down solver (pre-smoother)
    linear system matrix followed by preconditioner matrix:
    Mat Object:     2 MPI processes
      type: mffd
      rows=169, cols=169
        Matrix-free approximation:
          err=1.49012e-08 (relative error in function evaluation)
          Using wp compute h routine
              Does not compute normU
    Mat Object:     2 MPI processes
      type: mpiaij
      rows=169, cols=169
      total: nonzeros=793, allocated nonzeros=793
      total number of mallocs used during MatSetValues calls =0
