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. (LANL), Los Alamos, 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
- Resource Relation:
- Other Information: PBD: [1995]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Chebyshev recursion methods: Kernel polynomials and maximum entropy
Efficient maximum entropy algorithms for electronic structure
Kernel polynomial approximations for densities of states and spectral functions
Technical Report
·
Sun Oct 01 00:00:00 EDT 1995
·
OSTI ID:195578
+1 more
Efficient maximum entropy algorithms for electronic structure
Conference
·
Mon Apr 01 00:00:00 EST 1996
·
OSTI ID:195578
+1 more
Kernel polynomial approximations for densities of states and spectral functions
Journal Article
·
Fri Mar 01 00:00:00 EST 1996
· Journal of Computational Physics
·
OSTI ID:195578
+1 more