Search results for "symboli"
showing 10 items of 606 documents
Numerical evaluation of multiple polylogarithms
2004
Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for arbitrary complex arguments and without any restriction on the weight. We have implemented these algorithms with arbitrary precision arithmetic in C++ within the GiNaC framework.
On Meet-Complements in Cohn Geometries
1993
Within the frame of projective lattice geometry, the present paper investigates classes of meet-complements in Cohn geometries and especially in Ore and Bezout geometries. The algebraic background of these geometries is given by torsion free modules over domains — in particular Ore and Bezout domains. 1
Properties of Generalized Polynomial Spaces in Three Variables
2009
Multivariate interpolation is a topic which often appears in practical modeling problems. Different type of spaces of functions are used for solving interpolation problems. When the interpolation conditions are of different kind, by example, spacial and temporal, one possibility for modeling the problem is to use a generalize degree, in which the monomials exponents are weighted with a weight vector with integer components. In order to use such a generalize polynomial space as interpolation space, it is necessary to know the dimension and a basis of it. The aim of this article is to study and prove many properties of the generalize polynomial spaces in three variables.
One-loop integrals with XLOOPS-GiNaC
2001
We present a new algorithm for the reduction of one-loop tensor Feynman integrals within the framework of the XLOOPS project, covering both mathematical and programming aspects. The new algorithm supplies a clean way to reduce the one-loop one-, two- and three-point Feynman integrals with arbitrary tensor rank and powers of the propagators to a basis of simple integrals. We also present a new method of coding XLOOPS in C++ using the GiNaC library.
Partial {$*$}-algebras of closable operators. II. States and representations of partial {$*$}-algebras
1991
This second paper on partial Op*-algebras is devoted to the theory of representations. A new definition of invariant positive sesquilinear forms on partial *-algebras is proposed, which enables to perform the familiar GNS construction. In order to get a better control of the corresponding representations, we introduce and study a restricted class of partial Op*-algebras, called partial GW*-algebras, which turn up naturally in a number of problems. As an example, we extend Powers' results about the standardness of GNS representations of abelian partial *-algebras.
Some Problems on Homomorphisms and Real Function Algebras
2001
In this paper we solve a problem about the representation of all homomorphisms on a real function algebra as point evaluations and another two about function algebras in which homomorphisms are point evaluations on sequences in the algebra.
Vectors, Tensors, Manifolds and Special Relativity
2015
Assuming that the reader is familiar with the notion of vectors, within a few pages, with a few examples, the reader will get to be familiar with the generic picture of tensors. With the specific notions given in this chapter, the reader will be able to understand more advanced tensor courses with no further effort. The transition between tensor algebra and tensor calculus is done naturally with a very familiar example. The notion of manifold and a few basic key aspects on Special Relativity are also presented.
A Non-antisymmetric Tensor Contraction Engine for the Automated Implementation of Spin-Adapted Coupled Cluster Approaches
2015
We present a symbolic manipulation algorithm for the efficient automated implementation of rigorously spin-free coupled cluster (CC) theories based on a unitary group parametrization. Due to the lack of antisymmetry of the unitary group generators under index permutations, all quantities involved in the equations are expressed in terms of non-antisymmetric tensors. Given two tensors, all possible contractions are first generated by applying Wick's theorem. Each term is then put down in the form of a non-antisymmetric Goldstone diagram by assigning its contraction topology. The subsequent simplification of the equations by summing up equivalent terms and their factorization by identifying co…
The Bernstein Basis and its applications in solving geometric constraint systems
2012
International audience; This article reviews the properties of Tensorial Bernstein Basis (TBB) and its usage, with interval analysis, for solving systems of nonlinear, univariate or multivariate equations resulting from geometric constraints. TBB are routinely used in computerized geometry for geometric modelling in CAD-CAM, or in computer graphics. They provide sharp enclosures of polynomials and their derivatives. They are used to reduce domains while preserving roots of polynomial systems, to prove that domains do not contain roots, and to make existence and uniqueness tests. They are compatible with standard preconditioning methods and fit linear program- ming techniques. However, curre…
La Grammaire de Condillac face au paradoxe de l'origine naturelle du langage
2012
The recent discovery of mirror neurons has rivived the gestural-imitative theory of the origin of language advocated by Condillac in the XVIIIth century. Condillac develops this theory in two stages: in the Essai (1746) he proposes a gestural theory based on the arbitrariness of the sign, while in the Grammaire (1775) he refuses arbitrariness and accepts the theory of analogy and natural imitation proposed by Charles de Brosses (1765). This choice depends on the fact that in Rousseau (1755) and Beauzee (1765) arbitrariness, as a "paradox of the original contract", now plays the role of key argument in favor of the divine origin of language. So, the theory of analogy and natural imitation is…