Kernel polynomial approximations for densities of states and spectral functions
Journal Article
·
· Journal of Computational Physics
- Los Alamos National Laboratory, NM (United States)
- Universitaet Bayreuth (Germany)
Chebyshev polynomial approximations are an efficient and numerically stable way to calculate properties of the very large Hamiltonians important in computational condensed matter physics. The present paper derives an optimal kernal polynomial which enforces positivity of density of states and spectral estimates, achieves the best energy resolution, and preserves normalization. This kernel polynomial method (KPM) is demonstrated for electronic structure and dynamic magnetic susceptibility calculations. For tight binding Hamiltonians of Si, we show how to achieve high precision and rapid convergence of the cohesive energy and vacancy formation energy by careful attention to the order of approximation. For disordered XXZ-magnets, we show that the KPM provides a simpler and more reliable procedure for calculating spectral functions than Lanczos recursion methods. Polynomial approximations to Fermi projection operators are also proposed. 26 refs., 10 figs.
- OSTI ID:
- 274228
- Journal Information:
- Journal of Computational Physics, Journal Name: Journal of Computational Physics Journal Issue: 1 Vol. 124; ISSN JCTPAH; ISSN 0021-9991
- Country of Publication:
- United States
- Language:
- English
Similar Records
Polynomial approximations for materials simulations
Chebyshev moment problems: Maximum entropy and kernel polynomial methods
Chebyshev recursion methods: Kernel polynomials and maximum entropy
Technical Report
·
Tue Jan 31 23:00:00 EST 1995
·
OSTI ID:34401
Chebyshev moment problems: Maximum entropy and kernel polynomial methods
Technical Report
·
Sat Dec 30 23:00:00 EST 1995
·
OSTI ID:195578
Chebyshev recursion methods: Kernel polynomials and maximum entropy
Technical Report
·
Sun Oct 01 00:00:00 EDT 1995
·
OSTI ID:119974