Related papers: Designing weight regularizations based on Lefschet…
Complex Langevin methods have been successfully applied in theories that suffer from a sign problem such as QCD with a chemical potential. We present and illustrate a novel method (dynamic stabilisation) that ensures that Complex Langevin…
The worldvolume tempered Lefschetz thimble method (WV-TLTM) is an algorithm towards solving the sign problem, where hybrid Monte Carlo updates are performed on a continuous accumulation of flowed surfaces foliated by the anti-holomorphic…
Lattice simulations of non-zero density QCD introduce the so-called sign problem (complex or negative probabilities), which invalidates importance sampling methods. To circumvent this, we use the Complex Langevin Equation (CLE), to measure…
Many fascinating systems suffer from a severe (complex action) sign problem preventing us from calculating them with Markov Chain Monte Carlo simulations. One promising method to alleviate the sign problem is the transformation of the…
Lefschetz thimbles regularisation of (lattice) field theories was put forward as a possible solution to the sign problem. Despite elegant and conceptually simple, it has many subtleties, a major one boiling down to a plain question: how…
LSQR, a Lanczos bidiagonalization based Krylov subspace iterative method, and its mathematically equivalent CGLS applied to normal equations system, are commonly used for large-scale discrete ill-posed problems. It is well known that LSQR…
Monte Carlo simulations of lattice quantum field theories on Lefschetz thimbles are non trivial. We discuss a new Monte Carlo algorithm based on the idea of computing contributions to the functional integral which come from complete flow…
We present the first practical Monte Carlo calculations of the recently proposed Lefschetz thimble formulation of quantum field theories. Our results provide strong evidence that the numerical sign problem that afflicts Monte Carlo…
The Complex Langevin (CL) method sometimes shows convergence to the wrong limit, even though the Schwinger-Dyson Equations (SDE) are fulfilled. We analyze this problem in a more general context for the case of one complex variable. We prove…
We study the sign problem in the Hubbard model on the hexagonal lattice away from half-filling using the Lefschetz thimbles method. We identify the saddle points, reduce their amount, and perform quantum Monte Carlo (QMC) simulations using…
In this paper we consider ill-posed inverse problems, both linear and nonlinear, by a heavy ball method in which a strongly convex regularization function is incorporated to detect the feature of the sought solution. We develop ideas on how…
For the large-scale linear discrete ill-posed problem $\min\|Ax-b\|$ or $Ax=b$ with $b$ contaminated by a white noise, Lanczos bidiagonalization based LSQR and its mathematically equivalent CGLS are most commonly used. They have intrinsic…
In this paper we investigate the problem of identifying the source term in an elliptic system from a single noisy measurement couple of the Neumann and Dirichlet data. A variational method of Tikhonov-type regularization with specific…
A possible solution of the notorious sign problem preventing direct Monte Carlo calculations for systems with non-zero chemical potential is to deform the integration region in the complex plane to a Lefschetz thimble. We investigate this…
For the large-scale linear discrete ill-posed problem $\min\|Ax-b\|$ or $Ax=b$ with $b$ contaminated by a white noise, the Lanczos bidiagonalization based LSQR method and its mathematically equivalent Conjugate Gradient (CG) method for…
Tikhonov regularization for projected solutions of large-scale ill-posed problems is considered. The Golub-Kahan iterative bidiagonalization is used to project the problem onto a subspace and regularization then applied to find a subspace…
Monte Carlo simulation of gauge theories with a $\theta$ term is known to be extremely difficult due to the sign problem. Recently there has been major progress in solving this problem based on the idea of complexifying dynamical variables.…
We introduce a projected complex Langevin (CL) numerical sampling method -- a fictitious Langevin dynamics scheme that uses numerical projection to sample a constrained stationary distribution with highly oscillatory character. Despite the…
In the landscape of approaches toward the simulation of Lattice Models with complex action the Complex Langevin (CL) appears as a straightforward method with a simple, well defined setup. Its applicability, however, is controlled by certain…
As is well known the Complex Langevin (CL) method sometimes fails to converge or converges to the wrong limit. We identified one reason for this long ago: insufficient decay of the probability density either near infinity or near poles of…