arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.4888cond-mat.mtrl-sci
收藏

用于电子结构计算的任意空间填充Voronoi多面体上的高效等参积分

Efficient Isoparametric Integration over Arbitrary, Space-Filling Voronoi Polyhedra for Electronic-Structure Calculations

Aftab Alam, S. N. Khan, Brian G. Wilson, D. D. Johnson

摘要:

提出了一种适用于{ \it ab-initio}电子结构计算的凸Voronoi多面体(VP)上的数值高效、精确且易于实现的积分方法.我们结合了加权Voronoi镶嵌等参积分通过高斯-勒让德求积提供快速收敛的VP积分的各种被积,包括库仑奇点。我们展示了我们的方法的能力,首先应用到一个分析电荷密度模型实现机器精度的精度与预期的收敛性能在毫秒。相比之下,我们将我们的结果与使用形状函数的结果进行了比较,并表明我们的方法比$10^{5}$更快,$10^{7}$更准确。加权Voronoi镶嵌还允许基于物理的空间划分,保证凸,空间填充VP,同时反映准确的原子大小和网站的电荷,因为我们在KKR方法应用于Fe-Pd合金。

英文摘要:

A numerically efficient, accurate, and easily implemented integration scheme over convex Voronoi polyhedra (VP) is presented for use in {\it ab-initio} electronic-structure calculations. We combine a weighted Voronoi tessellation with isoparametric integration via Gauss-Legendre quadratures to provide rapidly convergent VP integrals for a variety of integrands, including those with a Coulomb singularity. We showcase the capability of our approach by first applying to an analytic charge-density model achieving machine-precision accuracy with expected convergence properties in milliseconds. For contrast, we compare our results to those using shape-functions and show our approach is greater than $10^{5}$ faster and $10^{7}$ more accurate. A weighted Voronoi tessellation also allows for a physics-based partitioning of space that guarantees convex, space-filling VP while reflecting accurate atomic size and site charges, as we show within KKR methods applied to Fe-Pd alloys.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑