Publications

Order by: publication date number of citations

divERGe implements various Exact Renormalization Group examples

Jonas B. Profe, Dante M. Kennes, Lennart Klebl

SciPost Phys. Codebases 26 (2024) · published 8 February 2024 | · pdf

We present divERGe, an open source, high-performance C/C++/Python library for functional renormalization group (FRG) calculations on lattice fermions. The versatile model interface is tailored to real materials applications and seamlessly integrates with existing, standard tools from the ab-initio community. The code fully supports multi-site, multi-orbital, and non-SU(2) models in all of the three included FRG variants: TU$^2$FRG, N-patch FRG, and grid FRG. With this, the divERGe library paves the way for widespread application of FRG as a tool in the study of competing orders in quantum materials.

1 citation
Making digital objects FAIR in high energy physics: An implementation for Universal FeynRules Output (UFO) models

Mark S. Neubauer, Avik Roy, Zijun Wang

SciPost Phys. Codebases 13 (2023) · published 9 June 2023 | · pdf

Research in the data-intensive discipline of high energy physics (HEP) often relies on domain-specific digital contents. Reproducibility of research relies on proper preservation of these digital objects. This paper reflects on the interpretation of principles of Findability, Accessibility, Interoperability, and Reusability (FAIR) in such context and demonstrates its implementation by describing the development of an end-to-end support infrastructure for preserving and accessing Universal FeynRules Output (UFO) models guided by the FAIR principles. UFO models are custom-made python libraries used by the HEP community for Monte Carlo simulation of collider physics events. Our framework provides simple but robust tools to preserve and access the UFO models and corresponding metadata in accordance with the FAIR principles.

1 citation
Codebase release 1.0 for Nevanlinna.jl

Kosuke Nogaki, Jiani Fei, Emanuel Gull, Hiroshi Shinaoka

SciPost Phys. Codebases 19-r1.0 (2023) · published 13 November 2023 | · src

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.

1 citation
DFT2kp: Effective kp models from ab-initio data

João Victor V. Cassiano, Augusto de Lelis Araújo, Paulo E. Faria Junior, Gerson J. Ferreira

SciPost Phys. Codebases 25 (2024) · published 5 February 2024 | · pdf

The $k\cdot p$ method, combined with group theory, is an efficient approach to obtain the low energy effective Hamiltonians of crystalline materials. Although the Hamiltonian coefficients are written as matrix elements of the generalized momentum operator $\pi= p+ p_{SOC}$ (including spin-orbit coupling corrections), their numerical values must be determined from outside sources, such as experiments or ab initio methods. Here, we develop a code to explicitly calculate the Kane (linear in crystal momentum) and Luttinger (quadratic in crystal momentum) parameters of $k\cdot p$ effective Hamiltonians directly from ab initio wavefunctions provided by Quantum ESPRESSO. Additionally, the code analyzes the symmetry transformations of the wavefunctions to optimize the final Hamiltonian. This is an optional step in the code, where it numerically finds the unitary transformation $U$ that rotates the basis towards an optimal symmetry-adapted representation informed by the user. Throughout the paper, we present the methodology in detail and illustrate the capabilities of the code applying it to a selection of relevant materials. Particularly, we show a "hands-on" example of how to run the code for graphene (with and without spin-orbit coupling). The code is open source and available at https://gitlab.com/dft2kp/dft2kp.

1 citation
Variance reduction via simultaneous importance sampling and control variates techniques using vegas

Prasanth Shyamsundar, Jacob L. Scott, Stephen Mrenna, Konstantin T. Matchev, Kyoungchul Kong

SciPost Phys. Codebases 28 (2024) · published 4 March 2024 | · pdf

Monte Carlo (MC) integration is an important calculational technique in the physical sciences. Practical considerations require that the calculations are performed as accurately as possible for a given set of computational resources. To improve the accuracy of MC integration, a number of useful variance reduction algorithms have been developed, including importance sampling and control variates. In this work, we demonstrate how these two methods can be applied simultaneously, thus combining their benefits. We provide a python wrapper, named CoVVVR, which implements our approach in the VEGAS program. The improvements are quantified with several benchmark examples from the literature.

1 citation
Codebase release 1.0 for FermiFCI

Lukas Rammelmüller, David Huber, Artem G. Volosniev

SciPost Phys. Codebases 12-r1.0 (2023) · published 19 April 2023 | · src

We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.

1 citation
Automatic transformation of irreducible representations for efficient contraction of tensors with cyclic group symmetry

Yang Gao, Phillip Helms, Garnet Kin-Lic Chan, Edgar Solomonik

SciPost Phys. Codebases 10 (2023) · published 24 February 2023 | · pdf

Tensor contractions are ubiquitous in computational chemistry and physics, where tensors generally represent states or operators and contractions express the algebra of these quantities. In this context, the states and operators often preserve physical conservation laws, which are manifested as group symmetries in the tensors. These group symmetries imply that each tensor has block sparsity and can be stored in a reduced form. For nontrivial contractions, the memory footprint and cost are lowered, respectively, by a linear and a quadratic factor in the number of symmetry sectors. State-of-the-art tensor contraction software libraries exploit this opportunity by iterating over blocks or using general block-sparse tensor representations. Both approaches entail overhead in performance and code complexity. With intuition aided by tensor diagrams, we present a technique, irreducible representation alignment, which enables efficient handling of Abelian group symmetries via only dense tensors, by using contraction-specific reduced forms. This technique yields a general algorithm for arbitrary group symmetric contractions, which we implement in Python and apply to a variety of representative contractions from quantum chemistry and tensor network methods. As a consequence of relying on only dense tensor contractions, we can easily make use of efficient batched matrix multiplication via Intel's MKL and distributed tensor contraction via the Cyclops library, achieving good efficiency and parallel scalability on up to 4096 Knights Landing cores of a supercomputer.

1 citation
Codebase release 1.0 for Worm Algorithm for Bose-Hubbard and XXZ Models

Nicolas Sadoune, Lode Pollet

SciPost Phys. Codebases 9-r1.0 (2022) · published 29 November 2022 | · src

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path-integral representation of the partition function. The code can deal with arbitrary lattice structures and assumes spin-exchange terms, or bosonic hopping amplitudes, between nearest-neighbor sites, and local or nearest-neighbor interactions of the density-density type. We explicitly demonstrate the near-linear scaling of the algorithm with respect to the system volume and the inverse temperature and analyze the autocorrelation times in the vicinity of a $U(1)$ second order phase transition. The code is written in such a way that extensions to other lattice models as well as closely-related sign-positive models can be done straightforwardly on top of the provided framework.

1 citation
Codebase release 8.3 for PYTHIA

Christian Bierlich, Smita Chakraborty, Nishita Desai, Leif Gellersen, Ilkka Helenius, Philip Ilten, Leif Lönnblad, Stephen Mrenna, Stefan Prestel, Christian T. Preuss, Torbjörn Sjöstrand, Peter Skands, Marius Utheim, Rob Verheyen

SciPost Phys. Codebases 8-r8.3 (2022) · published 10 November 2022 | · src

This manual describes the Pythia event generator, the most recent version of an evolving physics tool used to answer fundamental questions in particle physics. The program is most often used to generate high-energy-physics collision "events", i.e. sets of particles produced in association with the collision of two incoming high-energy particles, but has several uses beyond that. The guiding philosophy is to produce and re-produce properties of experimentally obtained collisions as accurately as possible. The program includes a wide ranges of reactions within and beyond the Standard Model, and extending to heavy ion physics. Emphasis is put on phenomena where strong interactions play a major role. The manual contains both pedagogical and practical components. All included physics models are described in enough detail to allow the user to obtain a cursory overview of used assumptions and approximations, enabling an informed evaluation of the program output. A number of the most central algorithms are described in enough detail that the main results of the program can be reproduced independently, allowing further development of existing models or the addition of new ones. Finally, a chapter dedicated fully to the user is included towards the end, providing pedagogical examples of standard use cases, and a detailed description of a number of external interfaces. The program code, the online manual, and the latest version of this print manual can be found on the Pythia web page: https://www.pythia.org/.

1 citation
Codebase release 1.1 for LinReTraCe

Matthias Pickem, Emanuele Maggio, Jan M. Tomczak

SciPost Phys. Codebases 16-r1.1 (2023) · published 17 July 2023 | · src

We describe the "Linear Response Transport Centre" (LinReTraCe), a package for the simulation of transport properties of solids. LinReTraCe captures quantum (in)coherence effects beyond semi-classical Boltzmann techniques, while incurring similar numerical costs. The enabling algorithmic innovation is a semi-analytical evaluation of Kubo formulae for resistivities and the coefficients of Hall, Seebeck and Nernst. We detail the program's architecture, its interface and usage with electronic-structure packages such as WIEN2k, VASP, and Wannier90, as well as versatile tight-binding settings.

1 citation

Previous 1 2 3 4 5 6 Next

Publications

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation