An official website of the United States government
We present the TRIQS/Nevanlinna analytic continuation package, an efficient implementation of the methods proposed by J. Fei et al. (2021) [53] and (2021) [55]. TRIQS/Nevanlinna strives to provide a high quality open source (distributed under the GNU General Public License version 3) alternative to the more widely adopted Maximum Entropy based analytic continuation programs. With the additional Hardy functions optimization procedure, it allows for an accurate resolution of wide band and sharp features in the spectral function. Those problems can be formulated in terms of imaginary time or Matsubara frequency response functions. The application is based on the TRIQS C++/Python framework, which allows for easy interoperability with other TRIQS-based applications, electronic band structure codes and visualization tools. Similar to other TRIQS packages, it comes with a convenient Python interface.
more »
« less
Nevanlinna.jl: A Julia implementation of Nevanlinna analytic continuation
We introduce a Julia implementation of the recently proposed Nevanlinna analytic continuation method. The method is based on Nevanlinna interpolants and inherently preserves the causality of a response function due to its construction. For theoretical calculations without statistical noise, this continuation method is a powerful tool to extract real-frequency information from numerical input data on the Matsubara axis. This method has been applied to first-principles calculations of correlated materials. This paper presents its efficient and full-featured open-source implementation of the method including the Hamburger moment problem and smoothing.
more »
« less
- Award ID(s):
- 2001465
- PAR ID:
- 10552763
- Publisher / Repository:
- SciPost Physics
- Date Published:
- Journal Name:
- SciPost Physics Codebases
- ISSN:
- 2949-804X
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Simulating quantum systems in a finite volume is a powerful theoretical tool to extract information about them. Real-world properties of the system are encoded in how its discrete energy levels change with the size of the volume. This approach is relevant not only for nuclear physics, where lattice methods for few- and many-nucleon states complement phenomenological shell-model descriptions and ab initio calculations of atomic nuclei based on harmonic oscillator expansions, but also for other fields such as simulations of cold atomic systems. This contribution presents recent progress concerning finite-volume simulations of few-body systems. In particular, it discusses details regarding the efficient numerical implementation of separable interactions and it presents eigenvector continuation as a method for performing robust and efficient volume extrapolations.more » « less
-
Abstract In this paper, we introduce the notion of an Evertse–Ferretti Nevanlinna constant and compare it with the birational Nevanlinna constant introduced by the authors in a recent joint paper. We then use it to recover several previously known results. This includes a 1999 example of Faltings from hisBaker’s Gardenarticle. We also extend the theory of these Nevanlinna constants to what we call “multidivisor Nevanlinna constants,” which allow the proximity function to involve the maximum of Weil functions for finitely many divisors.more » « less
-
null (Ed.)A bstract An alternative method is presented for extracting the von Neumann entropy − Tr( ρ ln ρ ) from Tr( ρ n ) for integer n in a quantum system with density matrix ρ . Instead of relying on direct analytic continuation in n , the method uses a generating function − Tr{ ρ ln[(1 − zρ )/(1 − z )]} of an auxiliary complex variable z . The generating function has a Taylor series that is absolutely convergent within |z| < 1, and may be analytically continued in z to z = −∞ where it gives the von Neumann entropy. As an example, we use the method to calculate analytically the CFT entanglement entropy of two intervals in the small cross ratio limit, reproducing a result that Calabrese et al. obtained by direct analytic continuation in n . Further examples are provided by numerical calculations of the entanglement entropy of two intervals for general cross ratios, and of one interval at finite temperature and finite interval length.more » « less
-
This study presents new results on a method to solve large kinematic synthesis systems termed Finite Root Generation. The method reduces the number of startpoints used in homotopy continuation to find all the roots of a kinematic synthesis system. For a single execution, many start systems are generated with corresponding startpoints using a random process such that startpoints only track to finite roots. Current methods are burdened by computations of roots to infinity. New results include a characterization of scaling for different problem sizes, a technique for scaling down problems using cognate symmetries, and an application for the design of a spined pinch gripper mechanism. We show that the expected number of iterations to perform increases approximately linearly with the quantity of finite roots for a given synthesis problem. An implementation that effectively scales the four-bar path synthesis problem by six using its cognate structure found 100% of roots in an average of 16,546 iterations over ten executions. This marks a roughly six-fold improvement over the basic implementation of the algorithm.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.21468/SciPostPhysCodeb.19
