KSP Object: 8 MPI processes
  type: cg
  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: 8 MPI processes
  type: mg
    type is MULTIPLICATIVE, levels=2 cycles=v
      Cycles per PCApply=1
      Using Galerkin computed coarse grid matrices
  Coarse grid solver -- level 0 -------------------------------
    KSP Object: (mg_coarse_) 8 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_) 8 MPI processes
      type: redundant
        First (color=0) of 8 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: cholesky
            out-of-place factorization
            tolerance for zero pivot 2.22045e-14
            matrix ordering: nd
            factor fill ratio given 5., needed 1.30264
              Factored matrix:
                Mat Object: (mg_coarse_redundant_) 1 MPI process
                  type: seqsbaij
                  rows=105, cols=105
                  package used to perform factorization: petsc
                  total: nonzeros=4244, allocated nonzeros=4244
          linear system matrix, which is also used to construct the preconditioner:
          Mat Object: 1 MPI process
            type: seqaij
            rows=105, cols=105
            total: nonzeros=6411, allocated nonzeros=6411
            total number of mallocs used during MatSetValues calls=0
              using I-node routines: found 31 nodes, limit used is 5
      linear system matrix, which is also used to construct the preconditioner:
      Mat Object: 8 MPI processes
        type: is
        rows=105, cols=105
        total: nonzeros=10368, allocated nonzeros=10368
        total number of mallocs used during MatSetValues calls=0
  Down solver (pre-smoother) on level 1 -------------------------------
    KSP Object: (mg_levels_1_) 8 MPI processes
      type: chebyshev
        Chebyshev polynomial of first kind
        eigenvalue targets used: min 0.144453, max 1.58898
        eigenvalues estimated via cg: min 0.0463722, max 1.44453
        eigenvalues estimated using cg with transform: [0. 0.1; 0. 1.1]
        KSP Object: (mg_levels_1_esteig_) 8 MPI processes
          type: cg
          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
        PC Object: 8 MPI processes
          type not yet set
          PC has not been set up so information may be incomplete
        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_) 8 MPI processes
      type: asm
        total subdomain blocks = 8, amount of overlap = 1
        restriction/interpolation type - RESTRICT
        Local solver information for first block is in the following KSP and PC objects on rank 0:
        Use -mg_levels_1_ksp_view ::ascii_info_detail to display information for all blocks
        KSP Object: (mg_levels_1_sub_) 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_levels_1_sub_) 1 MPI process
          type: icc
            out-of-place factorization
            0 levels of fill
            tolerance for zero pivot 2.22045e-14
            using Manteuffel shift [POSITIVE_DEFINITE]
            matrix ordering: natural
            factor fill ratio given 1., needed 1.00057
              Factored matrix:
                Mat Object: (mg_levels_1_sub_) 1 MPI process
                  type: seqsbaij
                  rows=540, cols=540, bs=3
                  package used to perform factorization: petsc
                  total: nonzeros=15795, allocated nonzeros=15795
          linear system matrix, which is also used to construct the preconditioner:
          Mat Object: (mg_levels_1_sub_) 1 MPI process
            type: seqbaij
            rows=540, cols=540, bs=3
            total: nonzeros=29952, allocated nonzeros=29952
            total number of mallocs used during MatSetValues calls=0
      linear system matrix, which is also used to construct the preconditioner:
      Mat Object: 8 MPI processes
        type: is
        rows=2160, cols=2160, bs=3
        total: nonzeros=156078, allocated nonzeros=156078
        total number of mallocs used during MatSetValues calls=0
          has attached near null space
  Up solver (post-smoother) same as down solver (pre-smoother)
  linear system matrix, which is also used to construct the preconditioner:
  Mat Object: 8 MPI processes
    type: is
    rows=2160, cols=2160, bs=3
    total: nonzeros=156078, allocated nonzeros=156078
    total number of mallocs used during MatSetValues calls=0
      has attached near null space
