This thesis presents a means of enhancing the iterative calculation techniques used in electronic structure calculations, particularly Kohn-Sham DFT. Based on the subspace iteration method of the FEAST eigenvalue solving algorithm, this nonlinear FEAST algorithm (NLFEAST) improves the convergence rate of traditional iterative methods and dramatically improves their robustness. A description of the algorithm is given, along with the results of numerical experiments that demonstrate its effectiveness and offer insight into the factors that determine how well it performs.
| Identifer | oai:union.ndltd.org:UMASS/oai:scholarworks.umass.edu:theses-2224 |
| Date | 01 January 2013 |
| Creators | Gavin, Brendan E |
| Publisher | ScholarWorks@UMass Amherst |
| Source Sets | University of Massachusetts, Amherst |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Masters Theses 1911 - February 2014 |
Page generated in 0.002 seconds