๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Automatic generation of Feynman graphs and amplitudes in QED

โœ Scribed by T. Kaneko; S. Kawabata; Y. Shimizu

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
842 KB
Volume
43
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis

Operating system: OSIV/F4 MSP (FACOM), VOS3 (HITAC),

VMS(VAX)

Programming language used: PASCAL High speed storage required: 160 Kwords (depending on the physical reaction)

No. of bits in a word: 32 Peripherals used: terminal or card reader for input, magnetic disk, line printer and graphic devices(option) for output No. of lines in combined program and test deck: 6664

๐Ÿ“œ SIMILAR VOLUMES

Generalized hypergeometric functions and
Generalized hypergeometric functions and the evaluation of scalar one-loop integrals in Feynman diagrams
โœ Luis G. Cabral-Rosetti; Miguel A. Sanchis-Lozano ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 93 KB

Present and future high-precision tests of the Standard Model and beyond for the fundamental constituents and interactions in Nature are demanding complex perturbative calculations involving multi-leg and multi-loop Feynman diagrams. Currently, large e ort is devoted to the search for closed express

On the random generation and counting of
On the random generation and counting of matchings in dense graphs
โœ J. Diaz; M. Serna; P. Spirakis ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 628 KB

In this work we present a fully randomized approximation scheme for counting the number of perfect matchings in a dense bipartite graphs, that is equivalent to get a fully randomized approximation scheme to the permanent of a dense boolean matrix. We achieve this known solution, through novel extens

Automatic grid generation of complex geo
Automatic grid generation of complex geometries in Cartesian co-ordinates
โœ Wanlai Lin; Ching Jen Chen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 429 KB

A method of automatic grid generation for complex boundaries in Cartesian co-ordinates is proposed in this paper. In addition to the Cartesian grid lines the diagonal segments are used for the approximations of complex geometries in Cartesian co-ordinates. A structured Cartesian grid is employed for