KSP Object: 8 MPI processes
  type: fetidp
    fully redundant: 1
    saddle point:    0
  Inner KSP solver details
    KSP Object: (fetidp_) 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: (fetidp_) 8 MPI processes
      type: shell
        FETI-DP multipliers
          Dirichlet preconditioner (just from rank 0)
          Mat Object: 1 MPI process
            type: schurcomplement
            rows=156, cols=156
              Schur complement A11 - A10 inv(A00) A01
              A11
                Mat Object: 1 MPI process
                  type: seqaij
                  rows=156, cols=156, bs=3
                  total: nonzeros=4086, allocated nonzeros=4086
                  total number of mallocs used during MatSetValues calls=0
                    using I-node routines: found 52 nodes, limit used is 5
              A10
                Mat Object: 1 MPI process
                  type: seqaij
                  rows=156, cols=144
                  total: nonzeros=2412, allocated nonzeros=2412
                  total number of mallocs used during MatSetValues calls=0
                    using I-node routines: found 52 nodes, limit used is 5
              KSP solver for A00 block viewable with the additional option -fetidp_bddc_pc_bddc_dirichlet_ksp_view
              A01
                Mat Object: 1 MPI process
                  type: seqaij
                  rows=144, cols=156
                  total: nonzeros=2412, allocated nonzeros=2412
                  total number of mallocs used during MatSetValues calls=0
                    using I-node routines: found 42 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: F (fetidp_) 8 MPI processes
        type: shell
        rows=861, cols=861
  Inner BDDC solver details
    PC Object: (fetidp_bddc_) 8 MPI processes
      type: bddc
        Use verbose output: 0
        Use user-defined CSR: 0
        Use local mat graph: 1
        Connectivity graph topological dimension: 3
        Corner selection: 1 (selected 1)
        Use vertices: 1 (vertex size 3)
        Use edges: 1
        Use faces: 0
        Use true near null space: 0
        Use QR for single constraints on cc: 0
        Use change of basis on local edge nodes: 0
        Use change of basis on local face nodes: 0
        User defined change of basis matrix: 0
        Has change of basis matrix: 0
        Eliminate dirichlet boundary dofs: 1
        Switch on static condensation ops around the interface preconditioner: 0
        Use exact dirichlet trick: 1
        Interface extension: DIRICHLET
        Multilevel max levels: 0
        Multilevel coarsening ratio: 8
        Use estimated eigs for coarse problem: 0
        Use deluxe scaling: 0
        Use deluxe zerorows: 0
        Use deluxe singlemat: 0
        Rebuild interface graph for Schur principal minors: 0
        Number of dofs' layers for the computation of principal minors: -1
        Use user CSR graph to compute successive layers: 0
        Adaptive constraint selection threshold (active 0, userdefined 0): 0.
        Min constraints / connected component: 0
        Max constraints / connected component: 0
        Invert exact Schur complement for adaptive selection: 0
        Symmetric computation of primal basis functions: 0
        Num. Procs. to map coarse adjacency list: 0
        Coarse eqs per proc (significant at the coarsest level): 1
        Detect disconnected: 0 (filter 0)
        Benign subspace trick: 0 (change explicit 0)
        Benign subspace trick is active: 0
        Algebraic computation of no-net-flux: 0
      ********************************** STATISTICS AT LEVEL 0 **********************************
        Global dofs sizes: all 2160 interface 648 coarse 87
        Coarsening ratios: all/coarse 24 interface/coarse 7
        Active processes : 8
        Total subdomains : 8
        Dofs type        :	MIN	MAX	MEAN
        Interior  dofs   :	144	240	189
        Interface dofs   :	156	210	182
        Primal    dofs   :	36	36	36
        Local     dofs   :	300	450	371
        Local     subs   :	1	1
      --- Interior solver (rank 0)
        KSP Object: (fetidp_bddc_pc_bddc_dirichlet_) 1 MPI process
          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: (fetidp_bddc_pc_bddc_dirichlet_) 1 MPI process
          type: lu
            out-of-place factorization
            tolerance for zero pivot 2.22045e-14
            matrix ordering: nd
            factor fill ratio given 5., needed 1.55143
              Factored matrix follows:
                Mat Object: (fetidp_bddc_pc_bddc_dirichlet_) 1 MPI process
                  type: seqaij
                  rows=144, cols=144, bs=3
                  package used to perform factorization: petsc
                  total: nonzeros=9774, allocated nonzeros=9774
                    using I-node routines: found 45 nodes, limit used is 5
          linear system matrix = precond matrix:
          Mat Object: (fetidp_bddc_pc_bddc_dirichlet_) 1 MPI process
            type: seqaij
            rows=144, cols=144, bs=3
            total: nonzeros=6300, allocated nonzeros=6300
            total number of mallocs used during MatSetValues calls=0
              using I-node routines: found 48 nodes, limit used is 5
      --- Correction solver (rank 0)
        KSP Object: (fetidp_bddc_pc_bddc_neumann_) 1 MPI process
          type: preonly
          maximum iterations=1000, initial guess is zero
          tolerances:  relative=1e-10, absolute=1e-10, divergence=10000.
          left preconditioning
          using NONE norm type for convergence test
        PC Object: (fetidp_bddc_pc_bddc_neumann_) 1 MPI process
          type: lu
            out-of-place factorization
            tolerance for zero pivot 2.22045e-14
            matrix ordering: nd
            factor fill ratio given 5., needed 2.15584
              Factored matrix follows:
                Mat Object: (fetidp_bddc_pc_bddc_neumann_) 1 MPI process
                  type: seqaij
                  rows=279, cols=279, bs=3
                  package used to perform factorization: petsc
                  total: nonzeros=30753, allocated nonzeros=30753
                    using I-node routines: found 85 nodes, limit used is 5
          linear system matrix = precond matrix:
          Mat Object: (fetidp_bddc_pc_bddc_neumann_) 1 MPI process
            type: seqaij
            rows=279, cols=279, bs=3
            total: nonzeros=14265, allocated nonzeros=14265
            total number of mallocs used during MatSetValues calls=0
              using I-node routines: found 93 nodes, limit used is 5
      --- Coarse solver
        KSP Object: (fetidp_bddc_pc_bddc_coarse_) 8 MPI processes
          type: preonly
          maximum iterations=1000, initial guess is zero
          tolerances:  relative=1e-10, absolute=1e-10, divergence=10000.
          left preconditioning
          using NONE norm type for convergence test
        PC Object: (fetidp_bddc_pc_bddc_coarse_) 8 MPI processes
          type: redundant
            First (color=0) of 8 PCs follows
          linear system matrix = precond matrix:
          Mat Object: (fetidp_bddc_pc_bddc_coarse_) 8 MPI processes
            type: mpiaij
            rows=87, cols=87
            total: nonzeros=5277, allocated nonzeros=6796
            total number of mallocs used during MatSetValues calls=0
              using I-node (on process 0) routines: found 3 nodes, limit used is 5
                  KSP Object: (fetidp_bddc_pc_bddc_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
                    using NONE norm type for convergence test
                  PC Object: (fetidp_bddc_pc_bddc_coarse_redundant_) 1 MPI process
                    type: svd
                      All singular values smaller than 1e-12 treated as zero
                      Provided essential rank of the matrix 0 (all other eigenvalues are zeroed)
                    linear system matrix = precond matrix:
                    Mat Object: 1 MPI process
                      type: seqaij
                      rows=87, cols=87
                      total: nonzeros=5277, allocated nonzeros=5277
                      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: 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
  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: 8 MPI processes
  type: none
  linear system matrix = precond matrix:
  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
