FEAST

The FEAST solver package is a free high-performance numerical library for solving the standard or generalized eigenvalue problem, and obtaining all the eigenvalues and eigenvectors within a given search interval. It is based on an innovative fast and stable numerical algorithm -- named the FEAST algorithm -- which deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other Davidson-Jacobi techniques. The FEAST algorithm takes its inspiration from the density-matrix representation and contour integration technique in quantum mechanics. It is free from explicit orthogonalization procedures, and its main computational tasks consist of solving very few inner independent linear systems with multiple right-hand sides and one reduced eigenvalue problem orders of magnitude smaller than the original one. The FEAST algorithm combines simplicity and efficiency and offers many important capabilities for achieving high performance, robustness, accuracy, and scalability on parallel architectures. This general purpose FEAST solver package includes both reverse communication interfaces and ready to use predefined interfaces for dense, banded and sparse systems. It includes double and single precision arithmetic, and all the interfaces are compatible with Fortran (77,90) and C. FEAST is both a comprehensive library package, and an easy to use software. This solver is expected to significantly augment numerical performances and capabilities in large-scale modern applications.


References in zbMATH (referenced in 36 articles , 1 standard article )

Showing results 1 to 20 of 36.
Sorted by year (citations)

1 2 next

  1. Aishima, Kensuke: On convergence of iterative projection methods for symmetric eigenvalue problems (2017)
  2. Barkatou, Moulay; Boito, Paola; Segura Ugalde, Esteban: A contour integral approach to the computation of invariant pairs (2017)
  3. Bini, Dario A.; Massei, Stefano; Robol, Leonardo: On the decay of the off-diagonal singular values in cyclic reduction (2017)
  4. Druskin, Vladimir; Mamonov, Alexander V.; Zaslavsky, Mikhail: Multiscale S-fraction reduced-order models for massive wavefield simulations (2017)
  5. Imakura, Akira; Sakurai, Tetsuya: Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems (2017)
  6. Lin, Lin: Localized spectrum slicing (2017)
  7. Lin, Lin: Randomized estimation of spectral densities of large matrices made accurate (2017)
  8. Lu, Jianfeng; Yang, Haizhao: Preconditioning orbital minimization method for planewave discretization (2017)
  9. Misawa, Ryota; Niino, Kazuki; Nishimura, Naoshi: Boundary integral equations for calculating complex eigenvalues of transmission problems (2017)
  10. Xiao, Jinyou; Zhang, Chuanzeng; Huang, Tsung-Ming; Sakurai, Tetsuya: Solving large-scale nonlinear eigenvalue problems by rational interpolation and resolvent sampling based Rayleigh-Ritz method (2017)
  11. Xiao, Jinyou; Zhou, Hang; Zhang, Chuanzeng; Xu, Chao: Solving large-scale finite element nonlinear eigenvalue problems by resolvent sampling based Rayleigh-Ritz method (2017)
  12. Xi, Yuanzhe; Saad, Yousef: A rational function preconditioner for indefinite sparse linear systems (2017)
  13. Zheng, C.J.; Zhang, C.; Bi, C.X.; Gao, H.F.; Du, L.; Chen, H.B.: Coupled FE-BE method for eigenvalue analysis of elastic structures submerged in an infinite fluid domain (2017)
  14. Graen, Timo; Grubmüller, Helmut: NuSol -- numerical solver for the 3D stationary nuclear Schrödinger equation (2016)
  15. Huang, Ruihao; Struthers, Allan A.; Sun, Jiguang; Zhang, Ruming: Recursive integral method for transmission eigenvalues (2016)
  16. Imakura, Akira; Du, Lei; Sakurai, Tetsuya: Error bounds of Rayleigh-Ritz type contour integral-based eigensolver for solving generalized eigenvalue problems (2016)
  17. Imakura, Akira; Du, Lei; Sakurai, Tetsuya: Relationships among contour integral-based methods for solving generalized eigenvalue problems (2016)
  18. Kestyn, James; Polizzi, Eric; Tang, Ping Tak Peter: Feast eigensolver for non-Hermitian problems (2016)
  19. Li, Ruipeng; Xi, Yuanzhe; Vecharynski, Eugene; Yang, Chao; Saad, Yousef: A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems (2016)
  20. Nakatsukasa, Yuji; Freund, Roland W.: Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: the power of Zolotarev’s functions (2016)

1 2 next


Further publications can be found at: http://www.ecs.umass.edu/~polizzi/feast/references.htm