Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves

DOI10.1002/nla.2188OpenAlexW2898943945WikidataQ129970902 ScholiaQ129970902MaRDI QIDQ4558728

Eric Polizzi, Brendan Gavin

Publication date: 29 November 2018

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.00692

zbMATH Keywords

eigenvalue problemscontour integrationKrylov subspaceArnoldiFEASTinexact subspace iterations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (4)

A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices ⋮ An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval ⋮ Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects ⋮ Rational Spectral Filters with Optimal Convergence Rate

This page was built for publication: Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves