用于大规模电子结构计算的稀疏矩阵函数的高效计算:CheSS库
Efficient Computation of Sparse Matrix Functions for Large-Scale Electronic Structure Calculations: The CheSS Library
摘要:
我们目前的CheSS,“切比雪夫稀疏求解器”库,它已被设计用于解决在大规模的电子结构计算中出现的典型问题,使用本地化的基组。该库基于切比雪夫多项式的灵活和有效的扩展,目前具有密度矩阵的计算,任意幂的矩阵幂的计算,以及在选定的间隔中提取特征值。CheSS能够利用矩阵的稀疏性,并相对于非零条目的数量线性缩放,使其非常适合大规模计算。该方法特别适用于导致所涉及的矩阵的小光谱宽度的设置,并且在该制度中优于替代方法。通过耦合CheSS的DFT代码BigDFT,我们表明,这样一个有利的设置在实践中确实是可能的。此外,基于Chebyshev多项式的方法可以大规模并行化,并且即使对于相对较小的矩阵大小,CheSS也可以出色地扩展到数千个核心。
英文摘要:
We present CheSS, the "Chebyshev Sparse Solvers" library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。