A Fast minimal residual solver for overlap fermions
A Fast minimal residual solver for overlap fermions
复制标题
重叠费米子的快速最小残差求解器
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Alban Allkoci
中科院分区：
文献类型：
--
作者：
A. Boriçi;Alban Allkoci
计算具有重叠费米子的夸克传播子需要解一个移位的酉线性系统。Jagels和Reichel已经证明，对于这样的系统，可以通过短递归构造最小残差算法。J\ ulich-Wuppertal小组发现这个算法在重叠求解器中是最快的。本文给出了Arnoldi酉过程的一个三项递推式。利用新的递归构造了一个最小残差解算器，它是目前所考虑的用于重叠反演的所有Krylov子空间算法中最快的。
Computing quark propagators with overlap fermions requires the solution of a shifted unitary linear system. Jagels and Reichel have shown that for such systems it is possible to construct a minimal residual algorithm by short recurrences. The J\"ulich-Wuppertal group have found this algorithm to be the fastest among overlap solvers. In this paper we present a three-term recurrence for the Arnoldi unitary process. Using the new recurrence we construct a minimal residual solver which is the fastest among all Krylov subspace algorithms considered so far for the overlap inversion.