1987
DOI: 10.1016/0021-9991(87)90192-6
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for calculating quark propagators on large lattices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1987
1987
1992
1992

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…It is well known [1] that the convergence rate of iterative algorithms for propagators is governed by the condition number 1) of (−∆ + m 2 ) or (− D 2 + m 2 ). Therefore the CSD scaling relation for relaxation times τ reads…”
Section: Results For Propagators In 4-dimensional Su (2) Gauge Fieldsmentioning
confidence: 99%
See 2 more Smart Citations
“…It is well known [1] that the convergence rate of iterative algorithms for propagators is governed by the condition number 1) of (−∆ + m 2 ) or (− D 2 + m 2 ). Therefore the CSD scaling relation for relaxation times τ reads…”
Section: Results For Propagators In 4-dimensional Su (2) Gauge Fieldsmentioning
confidence: 99%
“…Retaining Ξ yields little difference in performance. 1) i. e. the ratio of the largest to the smallest eigenvalue 2) Using SOR as a smoother contradicts the conventional MG wisdom. However, in nontrivial gauge fields any over-relaxation yields better performance than Gauss-Seidel and much better performance than damped Jacobi or MR. A similar result was reported in a recent paper on MG gauge fixing [13].…”
Section: Bosonic Propagators In Nontrivial Gauge Fieldsmentioning
confidence: 99%
See 1 more Smart Citation