Search results for "Symbolic computation"
showing 10 items of 124 documents
Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language
2002
AbstractThe traditional split 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.
S3. Generalisation tests: Likelihood model, scenarios investigated and results from Hard to catch: experimental evidence supports evasive mimicry
2021
Detailed description of the different scenarios investigated for the generalisation test. Full results from the likelihood models are included as well.
Computer code from Sex roles and the evolution of parental care specialization.
2019
Computer code for the mathematical model in Mathematica
Computer code from Sex roles and the evolution of parental care specialization
2019
Computer code for the mathematical model in Mathematica
Computer code from Sex roles and the evolution of parental care specialization.
2019
Computer code for the mathematical model in Mathematica
Nondeterministic operations on finite relational structures
1998
Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…
INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH
2006
The simplest geometric constraints are incidences between points and lines in the projective plane. This problem is universal, in the sense that all algebraic systems reduce to such geometric constraints. Detecting incidence dependences between these geometric constraints is NP-complete. New methods to prove incidence theorems are proposed, which use strictly no computer algebra but only combinatorial arguments.
"Table 2" of "A measurement of alpha(s) from the scaling violation in e+ e- annihilation."
1996
alpha_s was evaluated from the scaling violation of the fragmentation func tions. The data from other experiments are used for the fitting procedure.
"Table 4" of "Inclusive production of neutral vector mesons in hadronic Z decays"
1995
Average multiplicity per hadronic event. Extrapolation to the full X range.
RationalizeRoots: Software Package for the Rationalization of Square Roots
2019
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.