Pole-based approximation of the Fermi-Dirac function
From MaRDI portal
Publication:1047074
DOI10.1007/S11401-009-0201-7zbMath1188.41007arXiv0906.1319OpenAlexW1988150292MaRDI QIDQ1047074
Lin Lin, Lexing Ying, Jian-feng Lu, E. Weinan
Publication date: 4 January 2010
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.1319
Related Items (13)
A bootstrap method for sum-of-poles approximations ⋮ Efficient iterative method for solving the Dirac-Kohn-Sham density functional theory ⋮ Cubic scaling algorithms for RPA correlation using interpolative separable density fitting ⋮ Generalized quadrature for finite temperature Green's function methods ⋮ Adaptive local basis set for Kohn-Sham density functional theory in a discontinuous Galerkin framework. I: Total energy calculation ⋮ Optimized local basis set for Kohn-Sham density functional theory ⋮ Numerical solution of large scale Hartree–Fock–Bogoliubov equations ⋮ Preconditioning Orbital Minimization Method for Planewave Discretization ⋮ Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation ⋮ RESCU: a real space electronic structure method ⋮ QM/MM Methods for Crystalline Defects. Part 1: Locality of the Tight Binding Model ⋮ Split representation of adaptively compressed polarizability operator ⋮ Numerical methods for Kohn–Sham density functional theory
Cites Work
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
- Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials.
- Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
- A fast algorithm for particle simulations
This page was built for publication: Pole-based approximation of the Fermi-Dirac function
