INvestigation Of The Biconjugate Gradient Algorithm For The Inversion Of Fermion Matrices
Markus Plagge
Abstract
An algorithm for the numerical inversion of large matrices, the biconjugate gradient algorithm (BGA), is investigated in view of its use for Monte Carlo simulations of fermionic field theories. It is compared with the usual conjugate gradient algorithm (CGA) and the minimal residue algorithm (MRA) within a Higgs-Yukawa model including mirror fermions. For this model it can be shown that BGA represents an improvement under certain circumstances where the other two slow down.
Create a lesson
Related papers
Simulating a chiral gauge theory
Laurens Lootens, Hersh Singh
Quantum Computing for Entanglement Asymmetry and the Quantum Mpemba Effect in Field Theory
Keisuke Fujii, Harunobu Fujimura, Masazumi Honda et al.
Finite-volume Analysis of On-shell Subtraction in the Luescher formalism
Wanchen Lei, Yuting Wang, Jin-Yi Pang
A Note On Lattice Definition of Gauge Theories With Chiral Fermions
Edward Witten
Can multi-level Monte-Carlo address the sign problem in a finite-density Bose gas?
Rajatha Ranpatige, Finn M. Stokes
Confining strings in the reconfined phase of trace deformed three dimensional SU(2) Yang-Mills theory
Claudio Bonati, Michele Caselle, Alessio Negro et al.