pith. sign in

arxiv: 1204.1726 · v1 · pith:BA4PVKIGnew · submitted 2012-04-08 · 💻 cs.NA · math.NA

Dissecting the FEAST algorithm for generalized eigenproblems

classification 💻 cs.NA math.NA
keywords feastcomputingmethodaccuracyalgorithmanalyzechoiceclose
0
0 comments X p. Extension
pith:BA4PVKIG Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{BA4PVKIG}

Prints a linked pith:BA4PVKIG badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

We analyze the FEAST method for computing selected eigenvalues and eigenvectors of large sparse matrix pencils. After establishing the close connection between FEAST and the well-known Rayleigh-Ritz method, we identify several critical issues that influence convergence and accuracy of the solver: the choice of the starting vector space, the stopping criterion, how the inner linear systems impact the quality of the solution, and the use of FEAST for computing eigenpairs from multiple intervals. We complement the study with numerical examples, and hint at possible improvements to overcome the existing problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.