gesolve(1)

πŸ“¦ version 2.1.11, in fedora 43, fedora 44, nixos 26.05, nixpkgs unstable

πŸ’– NAME πŸ’–

okay so bestie, this is the manual page for gesolve(1) β€” a utility command that is literally an eigensolver for generalized eigenvalue problems. No cap. πŸ’…

✨ SYNOPSIS ✨

gesolve matrix_a_filename matrix_b_filename evalues_filename
evectors_filename residuals_filename iters_filename [options]

🌸 DESCRIPTION 🌸

okay so this program inputs the matrix data from matrix_a_filename and matrix_b_filename, and solves the generalized eigenvalue problem A*x = l*B*x with the solver specified by options. It outputs the specified number of eigenvalues β€” and the number of those is given by option -ss β€” to evalues_filename, and the associated eigenvectors, residual norms, and numbers of iterations to evectors_filename, residuals_filename, and iters_filename respectively, all in the extended Matrix Market format (see Appendix of Lis User Guide). Both the Matrix Market format and the Harwell-Boeing format are supported for the matrix filenames. πŸ¦‹

πŸ’… OPTIONS πŸ’…

The following options are supported, bestie:

πŸŽ€ -e eigensolver πŸŽ€

  • -e eigensolver β€” The following options are supported for eigensolver:
    • -e {gpi|9} β€” Generalized Power
    • -e {gii|10} β€” Generalized Inverse
    • -e {grqi|11} β€” Generalized Rayleigh Quotient
    • -e {gcg|12} β€” Generalized CR
    • -e {gcr|13} β€” Generalized CR
    • -e {gsi|14} β€” Generalized Subspace
      • -ss [1] β€” The size of the subspace
    • -e {gli|15} β€” Generalized Lanczos
      • -ss [1] β€” The size of the subspace
    • -e {gai|16} β€” Generalized Arnoldi
      • -ss [1] β€” The size of the subspace

πŸŽ€ -i linear solver πŸŽ€

  • -i linear solver β€” The following options are supported for inner linear solver:
    • -i {cg|1} β€” CG
    • -i {bicg|2} β€” BiCG
    • -i {cgs|3} β€” CGS
    • -i {bicgstab|4} β€” BiCGSTAB
    • -i {bicgstabl|5} β€” BiCGSTAB(l)
      • -ell [2] β€” The degree l
    • -i {gpbicg|6} β€” GPBiCG
    • -i {tfqmr|7} β€” TFQMR
    • -i {orthomin|8} β€” Orthomin(m)
      • -restart [40] β€” The restart value m
    • -i {gmres|9} β€” GMRES(m)
      • -restart [40] β€” The restart value m
    • -i {jacobi|10} β€” Jacobi
    • -i {gs|11} β€” Gauss-Seidel
    • -i {sor|12} β€” SOR
      • -omega [1.9] β€” The relaxation coefficient omega (0<omega<2)
    • -i {bicgsafe|13} β€” BiCGSafe
    • -i {cr|14} β€” CR
    • -i {bicr|15} β€” BiCR
    • -i {crs|16} β€” CRS
    • -i {bicrstab|17} β€” BiCRSTAB
    • -i {gpbicr|18} β€” GPBiCR
    • -i {bicrsafe|19} β€” BiCRSafe
    • -i {fgmres|20} β€” FGMRES(m)
      • -restart [40] β€” The restart value m
    • -i {idrs|21} β€” IDR(s)
      • -irestart [2] β€” The restart value s
    • -i {idr1|22} β€” IDR(1)
    • -i {minres|23} β€” MINRES
    • -i {cocg|24} β€” COCG
    • -i {cocr|25} β€” COCR

πŸŽ€ -p preconditioner πŸŽ€

  • -p preconditioner β€” The following options are supported for preconditioner:
    • -p {none|0} β€” None
    • -p {jacobi|1} β€” Jacobi
    • -p {ilu|2} β€” ILU(k)
      • -ilu_fill [0] β€” The fill level k
    • -p {ssor|3} β€” SSOR
      • -ssor_omega [1.0] β€” The relaxation coefficient omega (0<omega<2)
    • -p {hybrid|4} β€” Hybrid
      • -hybrid_i [sor] β€” The linear solver
      • -hybrid_maxiter [25] β€” The maximum number of the iterations
      • -hybrid_tol [1.0e-3] β€” The convergence criterion
      • -hybrid_omega [1.5] β€” The relaxation coefficient omega of the SOR (0<omega<2)
      • -hybrid_ell [2] β€” The degree l of the BiCGSTAB(l)
      • -hybrid_restart [40] β€” The restart values of the GMRES and Orthomin
    • -p {is|5} β€” I+S
      • -is_alpha [1.0] β€” The parameter alpha of I+alpha*S(m)
      • -is_m [3] β€” The parameter m of I+alpha*S(m)
    • -p {sainv|6} β€” SAINV
      • -sainv_drop [0.05] β€” The drop criterion
    • -p {saamg|7} β€” SA-AMG
      • -saamg_unsym [false] β€” Select the unsymmetric version (The matrix structure must be symmetric)
      • -saamg_theta [0.05|0.12] β€” The drop criterion
    • -p {iluc|8} β€” Crout ILU
      • -iluc_drop [0.05] β€” The drop criterion
      • -iluc_rate [5.0] β€” The ration of maximum fill-in
    • -p {ilut|9} β€” ILUT
      • -ilut_drop [0.05] β€” The drop criterion
      • -ilut_rate [5.0] β€” The ration of maximum fill-in
    • -adds true β€” Additive Schwarz
      • -adds_iter [1] β€” The number of the iteration

🌟 Other Options for eigensolver: 🌟

  • -emaxiter [1000] β€” The maximum number of the iterations
  • -etol [1.0e-12] β€” The convergence criterion
  • -eprint [0] β€” The output of the residual history
    • -eprint {none|0} β€” None
    • -eprint {mem|1} β€” Save the residual history
    • -eprint {out|2} β€” Output it to the standard output
    • -eprint {all|3} β€” Save the residual history and output it to the standard output
  • -ige [gii] β€” The inner eigensolver used in generalized Subspace, generalized Lanczos, and generalized Arnoldi
  • -shift [0.0] β€” The amount of the shift
  • -initx_ones [true] β€” The behavior of the initial vector x_0
    • -initx_ones {false|0} β€” Given values
    • -initx_ones {true|1} β€” All values are set to 1
  • -omp_num_threads [t] β€” The number of the threads (t represents the maximum number of the threads)
  • -estorage [0] β€” The matrix storage format
  • -estorage_block [2] β€” The block size of the BSR and BSC formats
  • -ef [0] β€” The precision of the eigensolver
    • -ef {double|0} β€” Double precision
    • -ef {quad|1} β€” Double-double (quadruple) precision

🌈 Other options for inner linear solver: 🌈

  • -maxiter [1000] β€” The maximum number of the iterations
  • -tol [1.0e-12] β€” The convergence criterion
  • -print [0] β€” The output of the residual history
    • -print {none|0} β€” None
    • -print {mem|1} β€” Save the residual history
    • -print {out|2} β€” Output it to the standard output
    • -print {all|3} β€” Save the residual history and output it to the standard output
  • -scale [0] β€” The scaling
    • -scale {none|0} β€” No scaling
    • -scale {jacobi|1} β€” The Jacobi scaling
    • -scale {symm_diag|2} β€” The diagonal scaling
  • -initx_zeros [true] β€” The behavior of the initial vector x_0
    • -initx_zero {false|0} β€” Given values
    • -initx_zero {true|1} β€” All values are set to 0
  • -omp_num_threads [t] β€” The number of the threads (t represents the maximum number of the threads)
  • -storage [0] β€” The matrix storage format
  • -storage_block [2] β€” The block size of the BSR and BSC formats
  • -f [0] β€” The precision of the linear solver
    • -f {double|0} β€” Double precision
    • -f {quad|1} β€” Double-double (quadruple) precision

See Lis User Guide for full description.

🌟 EXIT STATUS 🌟

The following exit values are returned:

  • 0 β€” The process is normally terminated
  • unspecified β€” An error occurred

πŸ”₯ SEE ALSO πŸ”₯


and that's the whole manual page, bestie! It's gesolve(1), from the Man Page source/version, dated 4 Nov 2017. Slay. πŸ’…βœ¨

πŸ“¦ where this page comes from