Calculation of densities of states and spectral functions by Chebyshev recursion and maximum entropy

@article{Silver1997CalculationOD,
  title={Calculation of densities of states and spectral functions by Chebyshev recursion and maximum entropy},
  author={Richard N. Silver and Heinrich Roder},
  journal={Physical Review E},
  year={1997},
  volume={56},
  pages={4822-4829}
}
We present an efficient algorithm for calculating spectral properties of large sparse Hamiltonian matrices such as densities of states and spectral functions. The combination of Chebyshev recursion and maximum entropy achieves high-energy resolution without significant roundoff error, machine precision, or numerical instability limitations. If controlled statistical or systematic errors are acceptable, CPU and memory requirements scale linearly in the number of states. The inference of spectral… 

Figures from this paper

The kernel polynomial method

Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics. In this article we review

Maximum entropy and the problem of moments: a stable algorithm.

TLDR
A technique for entropy optimization to calculate a distribution from its moments by 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.

Fast Computation of Spectral Densities for Generalized Eigenvalue Problems

TLDR
Two types of methods to efficiently estimate the spectral density of a matrix pencil when both A and B are Hermitian and, in addition, $B$ is positive definite are presented, based on the Kernel Polynomial Method and the Lanczos procedure.

Chebyshev-polynomial expansion of the localization length of Hermitian and non-Hermitian random chains.

TLDR
The Chebyshev-polynomial expansion of the inverse localization length of Hermitian and non-Hermitian random chains as a function of energy is studied and the only available efficient algorithm for finding the density of states of models with interactions is found.

Nonlinear inversion of a band-limited Fourier transform

Reconstruction of thermally symmetrized quantum autocorrelation functions from imaginary-time data.

  • C. Predescu
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is shown that the quantum autocorrelation functions are uniquely determined by and can be reconstructed from their sequence of derivatives at origin, and a general class of reconstruction algorithms is identified.

Function reconstruction as a classical moment problem: a maximum entropy approach

We present a systematic study of the reconstruction of non-negative functions via maximum entropy approach utilizing the information contained in a finite number of moments of the functions. For

Fast and Accurate Scheme for Green Functions and Eigenvectors : Regulated Polynomial Expansion without Gibbs Oscillation

An oscillation-free Fourier expansion is proposed and applied to the polynomial expansion of resolvent operator, as an alternative treatment for Gibbs phenomenon to the kernel polynomial method (KPM)

Improved eigenvalue shrinkage using weighted Chebyshev polynomial approximation

TLDR
This paper proposes an eigenvalue shrinkage method with the reduced Gibbs phenomenon by modifying the CPA using the weighted least squares approach, which can reduce the error as well as the CJPA.
...

References

SHOWING 1-3 OF 3 REFERENCES

The Symmetric Eigenvalue Problem

According to Parlett, 'Vibrations are everywhere, and so too are the eigenvalues associated with them. As mathematical models invade more and more disciplines, we can anticipate a demand for

accepted for publication in Physical Review B . 13 R . Kosloff

  • J . Chem . Phys .
  • 1994