SpM: Sparse modeling tool for analytic continuation of imaginary-time Green's function

Abstract We present SpM , a sparse modeling tool for the analytic continuation of imaginary-time Green’s function, licensed under GNU General Public License version 3. In quantum Monte Carlo simulation, dynamic physical quantities such as single-particle and magnetic excitation spectra can be obtained by applying analytic continuation to imaginary-time data. However, analytic continuation is an ill-conditioned inverse problem and thus sensitive to noise and statistical errors. SpM provides stable analytic continuation against noise by means of a modern regularization technique, which automatically selects bases that contain relevant information unaffected by noise. This paper details the use of this program and shows some applications. Program summary Program Title: SpM Program Files doi: http://dx.doi.org/10.17632/ycmpsnv5yx.1 Licensing provisions: GNU General Public License version 3 Programming language: C++. External routines/libraries: BLAS, LAPACK, and CPPLapack libraries. Nature of problem: The analytic continuation of imaginary-time input data to real-frequency spectra is known to be an ill-conditioned inverse problem and very sensitive to noise and the statistic errors. Solution method: By using a modern regularization technique, analytic continuation is made robust against noise since the basis that is unaffected by the noise is automatically selected.

[1]  Jae-Hoon Sim,et al.  Analytic continuation via domain knowledge free machine learning , 2018, Physical Review B.

[2]  R. Bryan,et al.  Maximum entropy analysis of oversampled data problems , 1990, European Biophysics Journal.

[3]  A. Tremblay,et al.  Maximum entropy analytic continuation for spectral functions with nonpositive spectral weight , 2015, 1507.01956.

[4]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[5]  Mark Jarrell,et al.  Bayesian inference and the analytic continuation of imaginary-time quantum Monte Carlo data , 1996 .

[6]  Federico Ricci-Tersenghi,et al.  Pseudolikelihood decimation algorithm improving the inference of the interaction network in a general class of Ising models. , 2013, Physical review letters.

[7]  Shogo Yamanaka,et al.  Detection of cheating by decimation algorithm , 2014, ArXiv.

[8]  A. Sandvik.  Stochastic method for analytic continuation of quantum Monte Carlo data , 1998 .

[9]  G. Mahan.  Many-particle physics , 1981 .

[10]  O. Gunnarsson,et al.  Analytical continuation of imaginary axis data using maximum entropy , 2010, 1001.4351.

[11]  J. Gubernatis,et al.  Quantum Monte Carlo Methods: Algorithms for Lattice Models , 2016 .

[12]  J. Skilling,et al.  Maximum entropy image reconstruction: general algorithm , 1984 .

[13]  Edmonton,et al.  Reliable Padé analytical continuation method based on a high-accuracy symbolic computation algorithm , 2000 .

[14]  M. Ohzeki,et al.  Sparse modeling approach to analytical continuation of imaginary-time quantum Monte Carlo data. , 2017, Physical review. E.

[15]  Mark Jarrell,et al.  Analytic continuation of quantum Monte Carlo data by stochastic analytical inference. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Jae-Hoon Sim,et al.  Maximum quantum entropy method , 2018, Physical Review B.

[17]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[18]  I. D. Marco,et al.  Analytic continuation by averaging Pade approximants , 2015, 1511.03496.

[19]  A. Sandvik.  Constrained sampling method for analytic continuation. , 2015, Physical review. E.