A concurrent pseudofermions algorithm

F. Fucito; S. Solomon

doi:10.1016/0010-4655(85)90119-5

A concurrent pseudofermions algorithm

F. Fucito^*, S. Solomon

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

A concurrent pseudofermions (pf) algorithm is used to invert sparse matrices which occur in the study of theories with interacting fermions. It is found that for lattice QCD the pf algorithm is particularly well suited for a concurrent environment because it can be reduced to the simulation of a classical statistical system with local interactions. We show that on the 32-nodes hypercube processor at Caltech, our pf program can invert matrices of dimensions O(10⁵x10⁵) with an efficiency around 0.97.

Original language	English
Pages (from-to)	141-145
Number of pages	5
Journal	Computer Physics Communications
Volume	36
Issue number	2
DOIs	https://doi.org/10.1016/0010-4655(85)90119-5
State	Published - Apr 1985
Externally published	Yes

Access to Document

10.1016/0010-4655(85)90119-5

Cite this

@article{54a89226ac524ba5816474dcc06205ed,

title = "A concurrent pseudofermions algorithm",

abstract = "A concurrent pseudofermions (pf) algorithm is used to invert sparse matrices which occur in the study of theories with interacting fermions. It is found that for lattice QCD the pf algorithm is particularly well suited for a concurrent environment because it can be reduced to the simulation of a classical statistical system with local interactions. We show that on the 32-nodes hypercube processor at Caltech, our pf program can invert matrices of dimensions O(105x105) with an efficiency around 0.97.",

author = "F. Fucito and S. Solomon",

year = "1985",

month = apr,

doi = "10.1016/0010-4655(85)90119-5",

language = "אנגלית",

volume = "36",

pages = "141--145",

journal = "Computer Physics Communications",

issn = "0010-4655",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - A concurrent pseudofermions algorithm

AU - Fucito, F.

AU - Solomon, S.

PY - 1985/4

Y1 - 1985/4

N2 - A concurrent pseudofermions (pf) algorithm is used to invert sparse matrices which occur in the study of theories with interacting fermions. It is found that for lattice QCD the pf algorithm is particularly well suited for a concurrent environment because it can be reduced to the simulation of a classical statistical system with local interactions. We show that on the 32-nodes hypercube processor at Caltech, our pf program can invert matrices of dimensions O(105x105) with an efficiency around 0.97.

AB - A concurrent pseudofermions (pf) algorithm is used to invert sparse matrices which occur in the study of theories with interacting fermions. It is found that for lattice QCD the pf algorithm is particularly well suited for a concurrent environment because it can be reduced to the simulation of a classical statistical system with local interactions. We show that on the 32-nodes hypercube processor at Caltech, our pf program can invert matrices of dimensions O(105x105) with an efficiency around 0.97.

UR - http://www.scopus.com/inward/record.url?scp=46549099084&partnerID=8YFLogxK

U2 - 10.1016/0010-4655(85)90119-5

DO - 10.1016/0010-4655(85)90119-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:46549099084

SN - 0010-4655

VL - 36

SP - 141

EP - 145

JO - Computer Physics Communications

JF - Computer Physics Communications

IS - 2

ER -

A concurrent pseudofermions algorithm

Abstract

Access to Document

Other files and links

Fingerprint

Cite this