Numerical sign problem: Difference between revisions

Revision as of 16:45, 20 July 2009

Revision as of 02:00, 5 October 2009

Line 1:

{{Context|date=October 2009}}

{{context}}

In [[physics]], the '''numerical sign problem''' refers to the slow [[statistics|statistical]]

convergence of a numerical integration procedure like the Metropolis [[Monte Carlo algorithm]],

Line 11:

== Sign problem of statistical field theories ==

=== Sampling with non-positive semidefinite weight functions ===

Line 120 ⟶ 119:

== Methods for reducing the sign problem ==

=== Analytical techniques ===