  0 KSP Residual norm 1.00731
  1 KSP Residual norm 0.0510812
  2 KSP Residual norm 0.00248709
  3 KSP Residual norm 0.000165921
  4 KSP Residual norm 1.1586e-05
  5 KSP Residual norm 8.71845e-07
KSP Object: 1 MPI process
  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: 1 MPI process
  type: mg
    type is FULL, levels=3 cycles=v
      Not using Galerkin computed coarse grid matrices
  Coarse grid solver -- level 0 -------------------------------
    KSP Object: (mg_coarse_) 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_) 1 MPI process
      type: lu
        out-of-place factorization
        tolerance for zero pivot 2.22045e-14
        using diagonal shift to prevent zero pivot [NONZERO]
        matrix ordering: nd
        factor fill ratio given 5., needed 2.21481
          Factored matrix:
            Mat Object: (mg_coarse_) 1 MPI process
              type: seqaij
              rows=27, cols=27
              package used to perform factorization: petsc
              total: nonzeros=299, allocated nonzeros=299
                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=135, allocated nonzeros=135
        total number of mallocs used during MatSetValues calls=0
          has attached null space
          not using I-node routines
  Down solver (pre-smoother) on level 1 -------------------------------
    KSP Object: (mg_levels_1_) 1 MPI process
      type: chebyshev
        Chebyshev polynomial of first kind
        eigenvalue targets used: min 0.0998964, max 1.09886
        eigenvalues estimated via gmres: min 0.181212, max 0.998964
        eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1]
        KSP Object: (mg_levels_1_esteig_) 1 MPI process
          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_) 1 MPI process
      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: 1 MPI process
        type: seqaij
        rows=216, cols=216
        total: nonzeros=1296, allocated nonzeros=1296
        total number of mallocs used during MatSetValues calls=0
          has attached null space
          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 process
      type: chebyshev
        Chebyshev polynomial of first kind
        eigenvalue targets used: min 0.0995188, max 1.09471
        eigenvalues estimated via gmres: min 0.0492983, max 0.995188
        eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1]
        KSP Object: (mg_levels_2_esteig_) 1 MPI process
          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_2_) 1 MPI process
      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: 1 MPI process
        type: seqaij
        rows=1728, cols=1728
        total: nonzeros=11232, allocated nonzeros=11232
        total number of mallocs used during MatSetValues calls=0
          has attached null space
          not using I-node routines
  Up solver (post-smoother) same as down solver (pre-smoother)
  linear system matrix, which is also used to construct the preconditioner:
  Mat Object: 1 MPI process
    type: seqaij
    rows=1728, cols=1728
    total: nonzeros=11232, allocated nonzeros=11232
    total number of mallocs used during MatSetValues calls=0
      has attached null space
      not using I-node routines
Residual norm 8.71845e-07
Error norm 0.0208751
Error norm 0.00618516
Error norm 0.000197005
