Related papers: FormCalc 7
We present the Feynman integral reduction program Kira 1.2 and describe its new features and other changes w.r.t. the previous versions. The main new features include a much faster equation generator, more flexible seed specification…
Algebraic effects and handlers are a mechanism to structure programs with computational effects in a modular way. They are recently gaining popularity and being adopted in practical languages, such as OCaml. Meanwhile, there has been…
For spin rotational symmetric models with a positive-definite high-temperature expansion of the partition function, a stochastic sampling of the series expansion upon partial resummation becomes logically equivalent to sampling an…
Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing compilation techniques for Hamiltonian simulation, in…
The Functional Machine Calculus (FMC) was recently introduced as a generalization of the lambda-calculus to include higher-order global state, probabilistic and non-deterministic choice, and input and output, while retaining confluence. The…
Tropical algebra, including max-plus, min-plus, and related idempotent semirings, provides a unifying framework in which many optimization problems that are nonlinear in classical algebra become linear. This property makes tropical methods…
We present a code modularization approach to design efficient and massively parallel cubic and linear-scaling solvers for electronic structure calculations using atomic orbitals. The modular implementation of the orbital minimization…
A very robust and efficient hybrid analytic-numerical Fock build, aMECP+aCOSx, has been developed for accelerating HF/DFT calculations. The essential idea is to extract those portions of the Fock matrix that can readily be evaluated…
A form compiler takes a high-level description of the weak form of partial differential equations and produces low-level code that carries out the finite element assembly. In this paper we present the Two-Stage Form Compiler (TSFC), a new…
Some recent additions to FORM are discussed. In particular large file support and the tablebases are presented.
We present three projects concerned with applications of proof assistants in the area of programming language theory and mathematics. The first project is about a certified compilation technique for a domain-specific programming language…
The integration of Large Language Models (LLMs) into optimization has created a powerful synergy, opening exciting research opportunities. This paper investigates how LLMs can enhance existing optimization algorithms. Using their…
This paper presents alpaqa, an open-source C++ implementation of an augmented Lagrangian method for nonconvex constrained numerical optimization, using the first-order PANOC algorithm as inner solver. The implementation is packaged as an…
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer…
Concepts and implementation of the Cuba library for multidimensional numerical integration are elucidated.
We describe the implementation of the MSSM in the diagram generator FeynArts and the calculational tool FormCalc. This extension allows to perform loop calculations of MSSM processes almost fully automatically. The actual implementation has…
A set of programs is presented for automatically generating and calculating Feynman diagrams. Diagrams are generated with FeynArts, then algebraically simplified using a combination of Mathematica and FORM implemented in the package…
Capture calculus has recently been proposed as a solution to effect checking, achieved by tracking the captured references of terms in the types. Boxes, along with the box and unbox operations, are a crucial construct in capture calculus,…
We describe TensoriaCalc, a tensor calculus package written to be smoothly consistent with the Wolfram Language, so as to ensure ease of usage. It allows multiple metrics to be defined in a given session; and, once a metric is computed,…
This paper shows how to build a sparse tensor algebra compiler that is agnostic to tensor formats (data layouts). We develop an interface that describes formats in terms of their capabilities and properties, and show how to build a modular…