Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves.
From MaRDI portal
Publication:4558728
Recommendations
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- A FEAST algorithm with oblique projection for generalized eigenvalue problems.
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
- Dissecting the FEAST algorithm for generalized eigenproblems
- Improving projection‐based eigensolvers via adaptive techniques
Cited in
(14)- Dissecting the FEAST algorithm for generalized eigenproblems
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
- Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- Kω -- open-source library for the shifted Krylov subspace method of the form \((z I - H)x = b\)
- Analysis of FEAST spectral approximations using the DPG discretization
- FEAST for differential eigenvalue problems
- Rational Spectral Filters with Optimal Convergence Rate
- Complex moment-based eigensolver coupled with two Krylov subspaces
- An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval
- A subspace iteration algorithm for Fredholm valued functions
- A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices
- A FEAST algorithm with oblique projection for generalized eigenvalue problems.
- An improved Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves
This page was built for publication: Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558728)