Mesh independence of the generalized Davidson algorithm

We give conditions under which the generalized Davidson algorithm for eigenvalue computations is mesh-independent. In this case mesh-independence means that the iteration statistics (residual norms, convergence rates, for example) of a sequence of discretizations of a problem in a Banach space conve...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational physics 2020-05, Vol.409 (C), p.109322, Article 109322
Main Authors: Kelley, C.T., Bernholc, J., Briggs, E.L., Hamilton, Steven, Lin, Lin, Yang, Chao
Format: Article
Language:English
Subjects:
Algorithms
Banach spaces
Computational physics
Convergence
Eigenvalues
Electronic structure computations
Generalized Davidson algorithm
Iterative methods
Mesh independence
Neutron transport
Norms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give conditions under which the generalized Davidson algorithm for eigenvalue computations is mesh-independent. In this case mesh-independence means that the iteration statistics (residual norms, convergence rates, for example) of a sequence of discretizations of a problem in a Banach space converge the statistics for the infinite-dimensional problem. We illustrate the result with several numerical examples.
ISSN:0021-9991
1090-2716
DOI:10.1016/j.jcp.2020.109322