
Singular value problem stored in file.

 Reading COMPLEX matrix from a binary file...
SVD Object: 1 MPI processes
  type: cyclic
    explicit matrix
    EPS Object: (svd_cyclic_) 1 MPI processes
      type: krylovschur
        50% of basis vectors kept after restart
        using the locking variant
      problem type: hermitian eigenvalue problem
      selected portion of the spectrum: closest to target: 12. (in magnitude)
      number of eigenvalues (nev): 2
      number of column vectors (ncv): 17
      maximum dimension of projected problem (mpd): 17
      maximum number of iterations: 100
      convergence test: relative to the eigenvalue
    BV Object: (svd_cyclic_) 1 MPI processes
      type: svec
      18 columns of global length 648
      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: (svd_cyclic_) 1 MPI processes
      type: hep
      solving the problem with: Implicit QR method (_steqr)
    ST Object: (svd_cyclic_) 1 MPI processes
      type: sinvert
      shift: 12.
      number of matrices: 1
      KSP Object: (svd_cyclic_st_) 1 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (svd_cyclic_st_) 1 MPI processes
        type: lu
          out-of-place factorization
          matrix ordering: nd
          factor fill ratio given 5., needed 3.17369
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=648, cols=648
                package used to perform factorization: petsc
                total: nonzeros=171722, allocated nonzeros=171722
                  not using I-node routines
        linear system matrix = precond matrix:
        Mat Object: (svd_cyclic_st_) 1 MPI processes
          type: seqaij
          rows=648, cols=648
          total: nonzeros=54108, allocated nonzeros=54108
          total number of mallocs used during MatSetValues calls =0
            not using I-node routines
  problem type: (standard) singular value problem
  transpose mode: explicit
  selected portion of the spectrum: largest
  number of singular values (nsv): 2
  number of column vectors (ncv): 17
  maximum dimension of projected problem (mpd): 17
  maximum number of iterations: 100
  convergence test: relative to the singular value
 Number of iterations of the method: 3
 Solution method: cyclic

 Number of requested singular values: 2
 Stopping condition: tol=1e-08, maxit=100
     1.52311, 1.29132

