Maximum entropy and the problem of moments: A stable algorithm
无序系统与神经网络
2009-11-10 v1
摘要
We present a technique for entropy optimization to calculate a distribution from its moments. The technique is based upon maximizing a discretized form of the Shannon entropy functional by mapping the problem onto a dual space where an optimal solution can be constructed iteratively. We demonstrate the performance and stability of our algorithm with several tests on numerically difficult functions. We then consider an electronic structure application, the electronic density of states of amorphous silica and study the convergence of Fermi level with increasing number of moments.
引用
@article{arxiv.cond-mat/0412717,
title = {Maximum entropy and the problem of moments: A stable algorithm},
author = {K. Bandyopadhyay and A. K. Bhattacharya and Parthapratim Biswas and D. A. Drabold},
journal= {arXiv preprint arXiv:cond-mat/0412717},
year = {2009}
}
备注
4 pages including 3 figures