Pith. sign in

REVIEW

Aggregation-based Multilevel Methods for Lattice QCD

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1202.2462 v1 pith:CBP4GIMD submitted 2012-02-11 hep-lat

Andreas Frommer , Karsten Kahl , Stefan Krieg , Björn Leder , Matthias Rottmann This is my paper · ORCID
classification hep-lat
keywords latticebeenconventionaldiracequationkrylovmethodsmultilevel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In Lattice QCD computations a substantial amount of work is spent in solving the Dirac equation. In the recent past it has been observed that conventional Krylov solvers tend to critically slow down for large lattices and small quark masses. We present a Schwarz alternating procedure (SAP) multilevel method as a solver for the Clover improved Wilson discretization of the Dirac equation. This approach combines two components (SAP and algebraic multigrid) that have separately been used in lattice QCD before. In combination with a bootstrap setup procedure we show that considerable speed-up over conventional Krylov subspace methods for realistic configurations can be achieved.

Discussion (0). Continue with ORCID to comment.

Pith tools