
Diagonal Nonlinear Eigenproblem, n=20

 Nonlinear function with 3 terms, with SAME nonzero pattern
Mat Object: 1 MPI process
  type: seqaij
row 0: (0, 1.) 
row 1: (1, 2.) 
row 2: (2, 3.) 
row 3: (3, 4.) 
row 4: (4, 5.) 
row 5: (5, 6.) 
row 6: (6, 7.) 
row 7: (7, 8.) 
row 8: (8, 9.) 
row 9: (9, 10.) 
row 10: (10, 11.) 
row 11: (11, 12.) 
row 12: (12, 13.) 
row 13: (13, 14.) 
row 14: (14, 15.) 
row 15: (15, 16.) 
row 16: (16, 17.) 
row 17: (17, 18.) 
row 18: (18, 19.) 
row 19: (19, 20.) 
FN Object: 1 MPI process
  type: rational
    polynomial: -1*x^1+0
 Type set to rii
 Two-sided flag = false
 Problem type before changing = 0 ... changed to 2.
 Refinement: SIMPLE, tol=1e-09, its=2, scheme=EXPLICIT
 Which = 7, target = 1.1
 Dimensions: nev=1, ncv=12, mpd=-1
 Tolerance = 0.000001, max_its = 200
 Convergence test = 0, stopping test = 0
DS Object: 1 MPI process
  type not yet set
RG Object: 1 MPI process
  type: interval
    region: [-inf.,inf.]x[-inf.,inf.]
NEP Object: 1 MPI process
  type: rii
    maximum number of inner iterations: 10
    updating the preconditioner every 1 iterations
    KSP Object: (nep_rii_) 1 MPI process
      type: gmres
        restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      maximum iterations=10000, initial guess is zero
      left preconditioning
      using PRECONDITIONED norm type for convergence test
    PC Object: (nep_rii_) 1 MPI process
      type: ilu
        out-of-place factorization
        0 levels of fill
        matrix ordering: natural
        factor fill ratio given 1., needed 1.
          Factored matrix follows:
            Mat Object: (nep_rii_) 1 MPI process
              type: seqaij
              rows=20, cols=20
              package used to perform factorization: petsc
              total: nonzeros=20, allocated nonzeros=20
                not using I-node routines
      linear system matrix = precond matrix:
      Mat Object: (nep_rii_) 1 MPI process
        type: seqaij
        rows=20, cols=20
        total: nonzeros=20, allocated nonzeros=20
        total number of mallocs used during MatSetValues calls=0
          not using I-node routines
  problem type: rational eigenvalue problem
  nonlinear operator in split form
    number of terms: 3
    nonzero pattern of the matrices: SAME
  selected portion of the spectrum: closest to target: 1.1 (in magnitude)
  number of eigenvalues (nev): 1
  number of column vectors (ncv): 1
  maximum dimension of projected problem (mpd): 1
  maximum number of iterations: 200
  convergence test: absolute
  iterative refinement: SIMPLE, with EXPLICIT scheme
  refinement stopping criterion: tol=1e-09, its=2
BV Object: 1 MPI process
  type: mat
  1 columns of global length 20
  vector orthogonalization method: classical Gram-Schmidt
  orthogonalization refinement: if needed (eta: 0.7071)
  block orthogonalization method: GS
  doing matmult as a single matrix-matrix product
DS Object: 1 MPI process
  type: nhep
  KSP Object: (nep_refine_) 1 MPI process
    type: gmres
      restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
    maximum iterations=10000, initial guess is zero
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object: (nep_refine_) 1 MPI process
    type: ilu
      out-of-place factorization
      0 levels of fill
      matrix ordering: natural
      factor fill ratio given 1., needed 1.
        Factored matrix follows:
          Mat Object: (nep_refine_) 1 MPI process
            type: seqaij
            rows=21, cols=21
            package used to perform factorization: petsc
            total: nonzeros=61, allocated nonzeros=61
              not using I-node routines
    linear system matrix = precond matrix:
    Mat Object: (nep_refine_) 1 MPI process
      type: seqaij
      rows=21, cols=21
      total: nonzeros=61, allocated nonzeros=61
      total number of mallocs used during MatSetValues calls=0
        not using I-node routines
 Finished - converged reason = 1
     1.00000

