  0 KSP Residual norm 1260.21 
  1 KSP Residual norm 186.106 
  2 KSP Residual norm 148.351 
  3 KSP Residual norm 53.1499 
  4 KSP Residual norm 42.8223 
  5 KSP Residual norm 9.84217 
  6 KSP Residual norm 5.14885 
  7 KSP Residual norm 1.97426 
  8 KSP Residual norm 1.43437 
  9 KSP Residual norm 0.607241 
 10 KSP Residual norm 0.287325 
 11 KSP Residual norm 0.072508 
 12 KSP Residual norm 0.0288296 
 13 KSP Residual norm 0.00948804 
Linear solve converged due to CONVERGED_RTOL iterations 13
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: gamg
    type is MULTIPLICATIVE, levels=3 cycles=v
      Cycles per PCApply=1
      Using externally compute Galerkin coarse grid matrices
      GAMG specific options
        Threshold for dropping small values in graph on each level =   -0.01   -0.01   -0.01  
        Threshold scaling factor for each level not specified = 1.
        Using aggregates from coarsening process to define subdomains for PCASM
        Using parallel coarse grid solver (all coarse grid equations not put on one process)
        AGG specific options
          Symmetric graph false
          Number of levels to square graph 1
          Number smoothing steps 1
        Complexity:    grid = 1.06341    operator = 1.11594
  Coarse grid solver -- level -------------------------------
    KSP Object: (mg_coarse_) 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: (mg_coarse_) 8 MPI processes
      type: jacobi
        type DIAGONAL
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=48, cols=48, bs=6
        total: nonzeros=2304, allocated nonzeros=2304
        total number of mallocs used during MatSetValues calls=0
          using I-node (on process 0) routines: found 5 nodes, limit used is 5
  Down solver (pre-smoother) on level 1 -------------------------------
    KSP Object: (mg_levels_1_) 8 MPI processes
      type: chebyshev
        eigenvalue targets used: min 0.361578, max 1.89829
        eigenvalues estimated via cg: min 0.0586155, max 1.80789
        eigenvalues estimated using cg with transform: [0. 0.2; 0. 1.05]
        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
        estimating eigenvalues using noisy right hand side
      maximum iterations=1, nonzero initial guess
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
      left preconditioning
      using NONE norm type for convergence test
    PC Object: (mg_levels_1_) 8 MPI processes
      type: asm
        total subdomain blocks = 12, amount of overlap = 0
        restriction/interpolation type - BASIC
        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 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_levels_1_sub_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.03896
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=84, cols=84
                package used to perform factorization: petsc
                total: nonzeros=5760, allocated nonzeros=5760
                  using I-node routines: found 19 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: (mg_levels_1_sub_) 1 MPI processes
          type: seqaij
          rows=84, cols=84
          total: nonzeros=5544, allocated nonzeros=5544
          total number of mallocs used during MatSetValues calls=0
            using I-node routines: found 25 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=474, cols=474, bs=6
        total: nonzeros=64476, allocated nonzeros=64476
        total number of mallocs used during MatSetValues calls=0
          using I-node (on process 0) routines: found 33 nodes, limit used is 5
  Up solver (post-smoother) same as down solver (pre-smoother)
  Down solver (pre-smoother) on level 2 -------------------------------
    KSP Object: (mg_levels_2_) 8 MPI processes
      type: chebyshev
        eigenvalue targets used: min 0.386231, max 2.02771
        eigenvalues estimated via cg: min 0.0227137, max 1.93116
        eigenvalues estimated using cg with transform: [0. 0.2; 0. 1.05]
        KSP Object: (mg_levels_2_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
        estimating eigenvalues using noisy right hand side
      maximum iterations=1, nonzero initial guess
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
      left preconditioning
      using NONE norm type for convergence test
    PC Object: (mg_levels_2_) 8 MPI processes
      type: asm
        total subdomain blocks = 79, amount of overlap = 0
        restriction/interpolation type - BASIC
        Local solver information for first block is in the following KSP and PC objects on rank 0:
        Use -mg_levels_2_ksp_view ::ascii_info_detail to display information for all blocks
      KSP Object: (mg_levels_2_sub_) 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_levels_2_sub_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.05263
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=48, cols=48
                package used to perform factorization: petsc
                total: nonzeros=1440, allocated nonzeros=1440
                  using I-node routines: found 14 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: (mg_levels_2_sub_) 1 MPI processes
          type: seqaij
          rows=48, cols=48
          total: nonzeros=1368, allocated nonzeros=1368
          total number of mallocs used during MatSetValues calls=0
            using I-node routines: found 16 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=8232, cols=8232, bs=3
        total: nonzeros=576000, allocated nonzeros=666792
        total number of mallocs used during MatSetValues calls=0
          has attached near null space
          using I-node (on process 0) routines: found 343 nodes, limit used is 5
  Up solver (post-smoother) same as down solver (pre-smoother)
  linear system matrix = precond matrix:
  Mat Object: 8 MPI processes
    type: mpiaij
    rows=8232, cols=8232, bs=3
    total: nonzeros=576000, allocated nonzeros=666792
    total number of mallocs used during MatSetValues calls=0
      has attached near null space
      using I-node (on process 0) routines: found 343 nodes, limit used is 5
  0 KSP Residual norm 0.0126021 
  1 KSP Residual norm 0.00186106 
  2 KSP Residual norm 0.00148351 
  3 KSP Residual norm 0.000531499 
  4 KSP Residual norm 0.000428223 
  5 KSP Residual norm 9.84217e-05 
  6 KSP Residual norm 5.14885e-05 
  7 KSP Residual norm 1.97426e-05 
  8 KSP Residual norm 1.43437e-05 
  9 KSP Residual norm 6.07241e-06 
 10 KSP Residual norm 2.87325e-06 
 11 KSP Residual norm 7.2508e-07 
 12 KSP Residual norm 2.88296e-07 
 13 KSP Residual norm 9.48804e-08 
Linear solve converged due to CONVERGED_RTOL iterations 13
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: gamg
    type is MULTIPLICATIVE, levels=3 cycles=v
      Cycles per PCApply=1
      Using externally compute Galerkin coarse grid matrices
      GAMG specific options
        Threshold for dropping small values in graph on each level =   -0.01   -0.01   -0.01  
        Threshold scaling factor for each level not specified = 1.
        Using aggregates from coarsening process to define subdomains for PCASM
        Using parallel coarse grid solver (all coarse grid equations not put on one process)
        AGG specific options
          Symmetric graph false
          Number of levels to square graph 1
          Number smoothing steps 1
        Complexity:    grid = 1.06341    operator = 1.11594
  Coarse grid solver -- level -------------------------------
    KSP Object: (mg_coarse_) 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: (mg_coarse_) 8 MPI processes
      type: jacobi
        type DIAGONAL
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=48, cols=48, bs=6
        total: nonzeros=2304, allocated nonzeros=2304
        total number of mallocs used during MatSetValues calls=0
          using nonscalable MatPtAP() implementation
          using I-node (on process 0) routines: found 5 nodes, limit used is 5
  Down solver (pre-smoother) on level 1 -------------------------------
    KSP Object: (mg_levels_1_) 8 MPI processes
      type: chebyshev
        eigenvalue targets used: min 0.361578, max 1.89829
        eigenvalues estimated via cg: min 0.0586155, max 1.80789
        eigenvalues estimated using cg with transform: [0. 0.2; 0. 1.05]
        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
        estimating eigenvalues using noisy right hand side
      maximum iterations=1, nonzero initial guess
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
      left preconditioning
      using NONE norm type for convergence test
    PC Object: (mg_levels_1_) 8 MPI processes
      type: asm
        total subdomain blocks = 12, amount of overlap = 0
        restriction/interpolation type - BASIC
        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 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_levels_1_sub_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.03896
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=84, cols=84
                package used to perform factorization: petsc
                total: nonzeros=5760, allocated nonzeros=5760
                  using I-node routines: found 19 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: (mg_levels_1_sub_) 1 MPI processes
          type: seqaij
          rows=84, cols=84
          total: nonzeros=5544, allocated nonzeros=5544
          total number of mallocs used during MatSetValues calls=0
            using I-node routines: found 25 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=474, cols=474, bs=6
        total: nonzeros=64476, allocated nonzeros=64476
        total number of mallocs used during MatSetValues calls=0
          using nonscalable MatPtAP() implementation
          using I-node (on process 0) routines: found 33 nodes, limit used is 5
  Up solver (post-smoother) same as down solver (pre-smoother)
  Down solver (pre-smoother) on level 2 -------------------------------
    KSP Object: (mg_levels_2_) 8 MPI processes
      type: chebyshev
        eigenvalue targets used: min 0.386231, max 2.02771
        eigenvalues estimated via cg: min 0.0227137, max 1.93116
        eigenvalues estimated using cg with transform: [0. 0.2; 0. 1.05]
        KSP Object: (mg_levels_2_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
        estimating eigenvalues using noisy right hand side
      maximum iterations=1, nonzero initial guess
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
      left preconditioning
      using NONE norm type for convergence test
    PC Object: (mg_levels_2_) 8 MPI processes
      type: asm
        total subdomain blocks = 79, amount of overlap = 0
        restriction/interpolation type - BASIC
        Local solver information for first block is in the following KSP and PC objects on rank 0:
        Use -mg_levels_2_ksp_view ::ascii_info_detail to display information for all blocks
      KSP Object: (mg_levels_2_sub_) 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_levels_2_sub_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.05263
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=48, cols=48
                package used to perform factorization: petsc
                total: nonzeros=1440, allocated nonzeros=1440
                  using I-node routines: found 14 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: (mg_levels_2_sub_) 1 MPI processes
          type: seqaij
          rows=48, cols=48
          total: nonzeros=1368, allocated nonzeros=1368
          total number of mallocs used during MatSetValues calls=0
            using I-node routines: found 16 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=8232, cols=8232, bs=3
        total: nonzeros=576000, allocated nonzeros=666792
        total number of mallocs used during MatSetValues calls=0
          has attached near null space
          using I-node (on process 0) routines: found 343 nodes, limit used is 5
  Up solver (post-smoother) same as down solver (pre-smoother)
  linear system matrix = precond matrix:
  Mat Object: 8 MPI processes
    type: mpiaij
    rows=8232, cols=8232, bs=3
    total: nonzeros=576000, allocated nonzeros=666792
    total number of mallocs used during MatSetValues calls=0
      has attached near null space
      using I-node (on process 0) routines: found 343 nodes, limit used is 5
  0 KSP Residual norm 0.0126021 
  1 KSP Residual norm 0.00186106 
  2 KSP Residual norm 0.00148351 
  3 KSP Residual norm 0.000531499 
  4 KSP Residual norm 0.000428223 
  5 KSP Residual norm 9.84217e-05 
  6 KSP Residual norm 5.14885e-05 
  7 KSP Residual norm 1.97426e-05 
  8 KSP Residual norm 1.43437e-05 
  9 KSP Residual norm 6.07241e-06 
 10 KSP Residual norm 2.87325e-06 
 11 KSP Residual norm 7.2508e-07 
 12 KSP Residual norm 2.88296e-07 
 13 KSP Residual norm 9.48804e-08 
Linear solve converged due to CONVERGED_RTOL iterations 13
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: gamg
    type is MULTIPLICATIVE, levels=3 cycles=v
      Cycles per PCApply=1
      Using externally compute Galerkin coarse grid matrices
      GAMG specific options
        Threshold for dropping small values in graph on each level =   -0.01   -0.01   -0.01  
        Threshold scaling factor for each level not specified = 1.
        Using aggregates from coarsening process to define subdomains for PCASM
        Using parallel coarse grid solver (all coarse grid equations not put on one process)
        AGG specific options
          Symmetric graph false
          Number of levels to square graph 1
          Number smoothing steps 1
        Complexity:    grid = 1.06341    operator = 1.11594
  Coarse grid solver -- level -------------------------------
    KSP Object: (mg_coarse_) 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: (mg_coarse_) 8 MPI processes
      type: jacobi
        type DIAGONAL
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=48, cols=48, bs=6
        total: nonzeros=2304, allocated nonzeros=2304
        total number of mallocs used during MatSetValues calls=0
          using nonscalable MatPtAP() implementation
          using I-node (on process 0) routines: found 5 nodes, limit used is 5
  Down solver (pre-smoother) on level 1 -------------------------------
    KSP Object: (mg_levels_1_) 8 MPI processes
      type: chebyshev
        eigenvalue targets used: min 0.361578, max 1.89829
        eigenvalues estimated via cg: min 0.0586155, max 1.80789
        eigenvalues estimated using cg with transform: [0. 0.2; 0. 1.05]
        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
        estimating eigenvalues using noisy right hand side
      maximum iterations=1, nonzero initial guess
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
      left preconditioning
      using NONE norm type for convergence test
    PC Object: (mg_levels_1_) 8 MPI processes
      type: asm
        total subdomain blocks = 12, amount of overlap = 0
        restriction/interpolation type - BASIC
        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 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_levels_1_sub_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.03896
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=84, cols=84
                package used to perform factorization: petsc
                total: nonzeros=5760, allocated nonzeros=5760
                  using I-node routines: found 19 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: (mg_levels_1_sub_) 1 MPI processes
          type: seqaij
          rows=84, cols=84
          total: nonzeros=5544, allocated nonzeros=5544
          total number of mallocs used during MatSetValues calls=0
            using I-node routines: found 25 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=474, cols=474, bs=6
        total: nonzeros=64476, allocated nonzeros=64476
        total number of mallocs used during MatSetValues calls=0
          using nonscalable MatPtAP() implementation
          using I-node (on process 0) routines: found 33 nodes, limit used is 5
  Up solver (post-smoother) same as down solver (pre-smoother)
  Down solver (pre-smoother) on level 2 -------------------------------
    KSP Object: (mg_levels_2_) 8 MPI processes
      type: chebyshev
        eigenvalue targets used: min 0.386231, max 2.02771
        eigenvalues estimated via cg: min 0.0227137, max 1.93116
        eigenvalues estimated using cg with transform: [0. 0.2; 0. 1.05]
        KSP Object: (mg_levels_2_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
        estimating eigenvalues using noisy right hand side
      maximum iterations=1, nonzero initial guess
      tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
      left preconditioning
      using NONE norm type for convergence test
    PC Object: (mg_levels_2_) 8 MPI processes
      type: asm
        total subdomain blocks = 79, amount of overlap = 0
        restriction/interpolation type - BASIC
        Local solver information for first block is in the following KSP and PC objects on rank 0:
        Use -mg_levels_2_ksp_view ::ascii_info_detail to display information for all blocks
      KSP Object: (mg_levels_2_sub_) 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_levels_2_sub_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.05263
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=48, cols=48
                package used to perform factorization: petsc
                total: nonzeros=1440, allocated nonzeros=1440
                  using I-node routines: found 14 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: (mg_levels_2_sub_) 1 MPI processes
          type: seqaij
          rows=48, cols=48
          total: nonzeros=1368, allocated nonzeros=1368
          total number of mallocs used during MatSetValues calls=0
            using I-node routines: found 16 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: 8 MPI processes
        type: mpiaij
        rows=8232, cols=8232, bs=3
        total: nonzeros=576000, allocated nonzeros=666792
        total number of mallocs used during MatSetValues calls=0
          has attached near null space
          using I-node (on process 0) routines: found 343 nodes, limit used is 5
  Up solver (post-smoother) same as down solver (pre-smoother)
  linear system matrix = precond matrix:
  Mat Object: 8 MPI processes
    type: mpiaij
    rows=8232, cols=8232, bs=3
    total: nonzeros=576000, allocated nonzeros=666792
    total number of mallocs used during MatSetValues calls=0
      has attached near null space
      using I-node (on process 0) routines: found 343 nodes, limit used is 5
[0]main |b-Ax|/|b|=2.572007e-04, |b|=4.630910e+00, emax=9.962625e-01
