MINIMIZING STORAGE IN IMPLEMENTATIONS OF THE OVERLAP LATTICE-DIRAC OPERATOR
MINIMIZING STORAGE IN IMPLEMENTATIONS OF THE OVERLAP LATTICE-DIRAC OPERATOR
复制标题
最小化重叠格狄拉克算子实现中的存储空间
DOI：
10.1142/s012918319900084x
复制
发表时间：
1998
影响因子：
1.9
通讯作者：
H. Neuberger
中科院分区：
文献类型：
--
作者：
H. Neuberger
重叠格-狄拉克算子包含符号函数H（H）。最近的实际实现通过多项式的比率H Pn（H2）/Qn（H2）来替换Qn（H），并且需要存储2n+2个大向量。在这里，我表明，一个可以只使用四个大向量的成本执行核心共轭算法两次。根据所使用计算机的体系结构，速度下降可能小于2倍。
The overlap lattice-Dirac operator contains the sign function ∊(H). Recent practical implementations replace ∊(H) by a ratio of polynomials, H Pn(H2)/Qn(H2), and require storage of 2n+2 large vectors. Here I show that one can use only four large vectors at the cost of executing the core conjugate algorithm twice. The slow-down might be less than by a factor of 2, depending on the architecture of the computer one uses.