arXiv subjects

Richard Kreckel

Publications and source records attributed to Richard Kreckel.

4 recordsLinked to original sources

arXiv2001

On the Invariance of Residues of Feynman Graphs

We use simple iterated one-loop graphs in massless Yukawa theory and QED to pose the following question: what are the symmetries of the residues of a graph under a permutation of places to insert subdivergences. The investigation confirms partial invariance of the residue under such permutations: the highest weight transcendental is invariant under such a permutation. For QED this result is gauge invariant, ie the permutation invariance holds for any gauge. Computations are done making use of the Hopf algebra structure of graphs and employing GiNaC to automate the calculations.

hep-th↗

arXiv2001

Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language

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 that deliberately denies the need for such a distinction. It is entirely written in C++ and the user can interact with it directly in that language. It was designed to provide efficient handling of multivariate polynomials, algebras and special functions that are needed for loop calculations in theoretical quantum field theory. It also bears some potential to become a more general purpose symbolic package.

cs.SC↗

arXiv1998

Parallelization of adaptive MC Integrators---Recent pvegas developments

This paper shortly describes some important changes to the pvegas-code since its first publication. It proceeds with a report on the scaling-behavior that was found on a wide range of current parallel hardware and discusses some issues of optimization that may be thrown up.

physics.comp-ph↗

arXiv1997

Parallelization of adaptive MC Integrators

Monte Carlo (MC) methods for numerical integration seem to be embarassingly parallel on first sight. When adaptive schemes are applied in order to enhance convergence however, the seemingly most natural way of replicating the whole job on each processor can potentially ruin the adaptive behaviour. Using the popular VEGAS-Algorithm as an example an economic method of semi-micro parallelization with variable grain-size is presented and contrasted with another straightforward approach of macro-parallelization. A portable implementation of this semi-micro parallelization is used in the xloops-project and is made publicly available.

physics.comp-ph↗