Expansion around half-integer values, binomial sums and inverse binomial sums

I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a symbolic computer algebra system. The method is an extension of the technique of nested sums. The algorithms allow in addition the evaluation of binomial sums, inverse binomial sums and generalizations thereof.Comment: 21 page

The infrared structure of e+ e- --> 3 jets at NNLO reloaded

This paper gives detailed information on the structure of the infrared singularities for the process e+ e- --> 3 jets at next-to-next-to-leading order in perturbation theory. Particular emphasis is put on singularities associated to soft gluons. The knowledge of the singularity structure allows the construction of appropriate subtraction terms, which in turn can be implemented into a numerical Monte Carlo program.Comment: 59 pages, additional comments added, version to be publishe

SFC-based Communication Metadata Encoding for Adaptive Mesh

This volume of the series “Advances in Parallel Computing” contains the proceedings of the International Conference on Parallel Programming – ParCo 2013 – held from 10 to 13 September 2013 in Garching, Germany. The conference was hosted by the Technische Universität München (Department of Informatics) and the Leibniz Supercomputing Centre.The present paper studies two adaptive mesh refinement (AMR) codes whose grids rely on recursive subdivison in combination with space-filling curves (SFCs). A non-overlapping domain decomposition based upon these SFCs yields several well-known advantageous properties with respect to communication demands, balancing, and partition connectivity. However, the administration of the meta data, i.e. to track which partitions exchange data in which cardinality, is nontrivial due to the SFC’s fractal meandering and the dynamic adaptivity. We introduce an analysed tree grammar for the meta data that restricts it without loss of information hierarchically along the subdivision tree and applies run length encoding. Hence, its meta data memory footprint is very small, and it can be computed and maintained on-the-fly even for permanently changing grids. It facilitates a forkjoin pattern for shared data parallelism. And it facilitates replicated data parallelism tackling latency and bandwidth constraints respectively due to communication in the background and reduces memory requirements by avoiding adjacency information stored per element. We demonstrate this at hands of shared and distributed parallelized domain decompositions.This work was supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Centre “Invasive Computing (SFB/TR 89). It is partially based on work supported by Award No. UK-c0020, made by the King Abdullah University of Science and Technology (KAUST)

On-the-fly memory compression for multibody algorithms.

Memory and bandwidth demands challenge developers of particle-based codes that have to scale on new architectures, as the growth of concurrency outperforms improvements in memory access facilities, as the memory per core tends to stagnate, and as communication networks cannot increase bandwidth arbitrary. We propose to analyse each particle of such a code to find out whether a hierarchical data representation storing data with reduced precision caps the memory demands without exceeding given error bounds. For admissible candidates, we perform this compression and thus reduce the pressure on the memory subsystem, lower the total memory footprint and reduce the data to be exchanged via MPI. Notably, our analysis and transformation changes the data compression dynamically, i.e. the choice of data format follows the solution characteristics, and it does not require us to alter the core simulation code

Fully differential QCD corrections to single top quark final states

A new next-to-leading order Monte Carlo program for calculation of fully differential single top quark final states is described and first results presented. Both the s- and t-channel contributions are included.Comment: 3 pages, 3 figures, talk presented at DPF2000, August 9-12, 2000. To appear in International Journal of Modern Physics

Infrared singularities in one-loop amplitudes

In this talk we discuss a purely numerical approach to next-to-leading order calculations in QCD. We present a simple formula, which provides a local infrared subtraction term for the integrand of a one-loop amplitude. In addition we briefly comment on local ultraviolet subtraction terms and on the required deformation of the contour of integration.Comment: 6 pages, talk given at the conference "Loops and Legs", Woerlitz, 201

One-loop N-point equivalence among negative-dimensional, Mellin-Barnes and Feynman parametrization approaches to Feynman integrals

We show that at one-loop order, negative-dimensional, Mellin-Barnes' (MB) and Feynman parametrization (FP) approaches to Feynman loop integrals calculations are equivalent. Starting with a generating functional, for two and then for $N$-point scalar integrals we show how to reobtain MB results, using negative-dimensional and FP techniques. The $N-$point result is valid for different masses, arbitrary exponents of propagators and dimension.Comment: 11 pages, LaTeX. To be published in J.Phys.