
Singular value problem stored in file.

 Reading REAL matrix from a binary file...
SVD Object: 1 MPI process
  type: cyclic
    explicit matrix
    EPS Object: (svd_cyclic_) 1 MPI process
      type: krylovschur
        50% of basis vectors kept after restart
        using the locking variant
      problem type: symmetric eigenvalue problem
      selected portion of the spectrum: closest to target: 12.5 (in magnitude)
      number of eigenvalues (nev): 4
      number of column vectors (ncv): 19
      maximum dimension of projected problem (mpd): 19
      maximum number of iterations: 100
      convergence test: relative to the eigenvalue
    BV Object: (svd_cyclic_) 1 MPI process
      type: mat
      20 columns of global length 400
      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 process
      type: hep
      solving the problem with: Implicit QR method (_steqr)
    ST Object: (svd_cyclic_) 1 MPI process
      type: sinvert
      shift: 12.5
      number of matrices: 1
      KSP Object: (svd_cyclic_st_) 1 MPI process
        type: preonly
        maximum iterations=10000, initial guess is zero
        left preconditioning
        not checking for convergence
      PC Object: (svd_cyclic_st_) 1 MPI process
        type: lu
          out-of-place factorization
          matrix ordering: nd
          factor fill ratio given 5., needed 7.06364
            Factored matrix:
              Mat Object: (svd_cyclic_st_) 1 MPI process
                type: seqaij
                rows=400, cols=400
                package used to perform factorization: petsc
                total: nonzeros=18648, allocated nonzeros=18648
                  not using I-node routines
        linear system matrix, which is also used to construct the preconditioner:
        Mat Object: (svd_cyclic_st_) 1 MPI process
          type: seqaij
          rows=400, cols=400
          total: nonzeros=2640, allocated nonzeros=2640
          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): 19
  maximum dimension of projected problem (mpd): 19
  maximum number of iterations: 100
  convergence test: relative to the singular value
 Number of iterations of the method: 2
 Solution method: cyclic

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

