Related papers: FORM version 4.0
We introduce FORM 4.2, a new minor release of the symbolic manipulation toolkit. We demonstrate several new features, such as a new pattern matching option, new output optimization, and automatic expansion of rational functions.
We present FORM 5, a major release of the symbolic-manipulation system FORM. Version 5 introduces an integrated diagram generator, based on the GRACE graph-generator, to produce Feynman diagrams directly from FORM scripts. This release also…
Some of the new features of the symbolic manipulation system FORM are discussed. Then some recent results running its multithreaded version TFORM are shown. Finally the plans for the future are presented.
Version 3 of FORM is introduced. It contains many new features that are inspired by current developments in the methodology of computations in quantum field theory. A number of these features is discussed in combination with examples. In…
We describe the implementation of facilities for the communication with external resources in the Symbolic Manipulation System FORM. This is done according to the POSIX standards defined for the UNIX operating system. We present a number of…
We present an implementation of algorithms for the symbolic integration of hyperlogarithms multiplied by rational functions in the computer algebra system FORM. This implementation encompasses cases where hyperlogarithms have rational…
We report on the status of our project of parallelization of the symbolic manipulation program FORM. We have now parallel versions of FORM running on Cluster- or SMP-architectures. These versions can be used to run arbitrary FORM programs…
Some recent additions to FORM are discussed. In particular large file support and the tablebases are presented.
The symbolic manipulation program FORM is specialized to handle very large algebraic expressions. Some specific features of its internal structure make FORM very well suited for parallelization. We have now two parallel versions of FORM,…
After an introduction to the sequential version of FORM and the mechanisms behind, we report on the status of our project of parallelization. We have now a parallel version of FORM running on Cluster- and SMP-architectures. This version can…
We give a brief introduction to FORM, a symbolic programming language for massive batch operations, designed by J.A.M. Vermaseren. In particular, we stress various methods to efficiently use FORM under the UNIX operating system. Several…
FormCalc is a Mathematica package for the automatic computation of tree-level and one-loop Feynman amplitudes. It accepts diagrams generated by FeynArts, simplifies them, and generates a complete Fortran code for their numerical evaluation.…
Applying Gr\"obner basis theory to concrete problems in Lean 4 remains difficult since the current formalization of multivariate polynomials is based on a non-computable representation and is therefore not suitable for efficient symbolic…
We discuss a number of FORM features that are essential in the automatic processing of very large numbers of diagrams as used in the Forcer program for 4-loop massless propagator diagrams. Most of these features are new.
Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums,where the harmonic sums and their…
After an introduction to the sequential version of FORM and the mechanisms behind it we report on the status of our ongoing project of its parallelization. An analysis of the parallel platforms used is given and the structure of a parallel…
FormCalc is a matrix-element generator that turns FeynArts amplitudes up to one loop into a Fortran code for computing the squared matrix element. The generated code can be run with FormCalc's own driver programs or used with other…
In this note we report on the new version of FeynCalc, a Mathematica package for symbolic semi-automatic evaluation of Feynman diagrams and algebraic expressions in quantum field theory. The main features of version 9.0 are: improved tensor…
We present TFORM, the version of the symbolic manipulation system FORM that can make simultaneous use of several processors in a shared memory architecture. The implementation uses Posix threads, also called pthreads, and is therefore…
While modern software development heavily uses versioned packages, programming languages rarely support the concept of versions in their semantics, which makes software updates more bulky and unsafe. This paper proposes a programming…