Chebyshev moment problems: Maximum entropy and kernel polynomial methods
Two Chebyshev recursion methods are presented for calculations with very large sparse Hamiltonians, the kernel polynomial method (KPM) and the maximum entropy method (MEM). They are applicable to physical properties involving large numbers of eigenstates such as densities of states, spectral functions, thermodynamics, total energies for Monte Carlo simulations and forces for tight binding molecular dynamics. this paper emphasizes efficient algorithms.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 195578
- Report Number(s):
- LA-UR--95-4112; ON: DE96005500
- Country of Publication:
- United States
- Language:
- English
Similar Records
Chebyshev recursion methods: Kernel polynomials and maximum entropy
Efficient maximum entropy algorithms for electronic structure
Calculation of densities of states and spectral functions by Chebyshev recursion and maximum entropy
Technical Report
·
Sun Oct 01 00:00:00 EDT 1995
·
OSTI ID:119974
Efficient maximum entropy algorithms for electronic structure
Conference
·
Sun Mar 31 23:00:00 EST 1996
·
OSTI ID:219385
Calculation of densities of states and spectral functions by Chebyshev recursion and maximum entropy
Journal Article
·
Wed Oct 01 00:00:00 EDT 1997
· Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
·
OSTI ID:632560