Comparison of Multi-quark Matrix Inversion Algorithms
He-Ping Ying, Shao-Jing Dong, Keh-Fei Liu
Abstract
We test iterative algorithms, MR, QMRγ5 and BiCGγ5, to compare their efficiency in matrix inversion with multi-quarks (shifted matrices) within one iteration process. Our results on the 83 x 12 and 163 x 24 show that MR admits multi-quark calculation with less memory requirement, whereas QMR is faster for the single quark calculation.
Create a lesson
Related papers
Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
Tianyin Li, Ying-Ying Li, Xiaoyang Wang et al.
Physics-informed quantum algorithms for glueball-like excitations in a Z2 lattice gauge theory
Dan-Bo Zhang
Anomalous behavior of Wilson fermions in the presence of monopoles
Manuel Cortina, Rajamani Narayanan, Ray Romero
Direct lattice QCD calculation of the θ-induced CP-violating pion-nucleon coupling
Chuan-Yang Li, Jun Hua, Jian Liang et al.
Calculation of neutron electric dipole moment from Lattice QCD
Thomas Blum, Fangcheng He, Taku Izubuchi et al.
Exponential-in-Nc2 cost reduction of product-formula-based quantum simulations of quantum chromodynamics
Zohreh Davoudi, Jesse R. Stryker