Abstract
Several algorithms were considered to accelerate the Fermi operator expansion (FOE) method. Novel fast summation methods were used to evaluate a matrix polynomial or Chebyshev matrix polynomial with matrix multiplications totalling roughly twice the square root of the degree of polynomial. Following this, six different representations of the Fermi operators were compared to assess the smallest possible degree of polynomial expansion for a given target precision. Results were analyzed in detail.
Original language | English |
---|---|
Pages (from-to) | 4117-4125 |
Number of pages | 9 |
Journal | Journal of Chemical Physics |
Volume | 119 |
Issue number | 8 |
DOIs | |
State | Published - 22 Aug 2003 |