Related papers: Reduze - Feynman Integral Reduction in C++
In recent years three-, four- and five-loop beta functions have been computed for various phenomenologically interesting models. However, most of these results have not been implemented in easy to use software packages. $\texttt{RGE++}$…
The Python package teareduce has been developed to support teaching activities related to the reduction of astronomical data. Specifically, it serves as instructional material for students participating in practical classes on the…
A REDUCE code for the Newman-Janis algorithm is described. This algorithm is intended to include rotation into nonrotating solutions of the Einstein field equations with spherically symmetry or perturbed spherically symmetry and has been…
Redundancy elimination is a key optimization direction, and loop nests are the main optimization target in modern compilers. Previous work on redundancy elimination of array computations in loop nests lacks universality. These approaches…
A new approach to compute Feynman Integrals is presented. It relies on an integral representation of a given Feynman Integral in terms of simpler ones. Using this approach, we present, for the first time, results for a certain family of…
MapReduce is a technique used to vastly improve distributed processing of data and can massively speed up computation. Hadoop and its MapReduce relies on JVM and Java which is expensive on memory. High Performance Computing based MapReduce…
This report provides an introduction to the ensmallen numerical optimization library, as well as a deep dive into the technical details of how it works. The library provides a fast and flexible C++ framework for mathematical optimization of…
The traditional split-up into a low level language and a high level language in the design of computer algebra systems may become obsolete with the advent of more versatile computer languages. We describe GiNaC, a special-purpose system…
These lectures give a brief introduction to the Computer Algebra systems Reduce and Maple. The aim is to provide a systematic survey of most important commands and concepts. In particular, this includes a discussion of simplification…
We present the main improvements and new features in version $\texttt{2.0}$ of the open-source $\texttt{C++}$ library $\texttt{FireFly}$ for the interpolation of rational functions. This includes algorithmic improvements, e.g. a hybrid…
Multi-threaded programs have many applications which are widely used such as operating systems. Analyzing multi-threaded programs differs from sequential ones; the main feature is that many threads execute at the same time. The effect of…
As safety-critical applications increasingly rely on data-parallel floating-point computations, there is an increasing need for flexible and configurable fault tolerance in parallel floating-point accelerators such as tensor engines. While…
This paper describes a modular framework for the description of electroweak scattering and decay processes, including but not limited to Z-resonance physics. The framework consistently combines a complex-pole expansion near a s-channel…
Verification of C++ programs has seen considerable progress in several areas, but not for programs that use these languages' mathematical libraries. The reason is that all libraries in widespread use come with no guarantees about the…
We present a generic C++ design to perform efficient and exact geometric computations using lazy evaluations. Exact geometric computations are critical for the robustness of geometric algorithms. Their efficiency is also critical for most…
Phase space cuts are implemented by inserting Heaviside theta functions in the integrands of momentum-space Feynman integrals. By directly parametrizing theta functions and constructing integration-by-parts (IBP) identities in the…
We present LinApart, a routine designed for efficiently performing the univariate partial fraction decomposition of large symbolic expressions. Our method is based on an explicit closed formula for the decomposition of rational functions…
The online data reduction service reductus transforms measurements in experimental science from laboratory coordinates into physically meaningful quantities with accurate estimation of uncertainties based on instrumental settings and…
Computational protein structure determination involves optimization in a problem space much too large to exhaustively search. Existing approaches include optimization algorithms such as gradient descent and simulated annealing, but these…
We report on some recent developments in algebraic tensor reduction of one-loop Feynman integrals. For 5-point functions, an efficient tensor reduction was worked out recently and is now available as numerical C++ package, PJFry, covering…