Computer Algebra System

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 11136 Experts worldwide ranked by ideXlab platform

Kasper Peeters - One of the best experts on this subject based on the ideXlab platform.

  • introducing cadabra a symbolic Computer Algebra System for field theory problems arxiv hep th 0701238v3 updated
    2018
    Co-Authors: Kasper Peeters
    Abstract:

    Cadabra is a new Computer Algebra System designed specifically for the solution of problems encountered in field theory. It has extensive functionality for tensor polynomial simplification taking care of Bianchi and Schouten identities, for fermions and anti-commuting variables, Clifford Algebras and Fierz transformations, implicit coordinate dependence, multiple index types and many other field theory related concepts. The input format is a subset of TeX and thus easy to learn. Both a command-line and a graphical interface are available. The present paper is an introduction to the program using several concrete problems from gravity, supergravity and quantum field theory.

  • cadabra a field theory motivated symbolic Computer Algebra System
    Computer Physics Communications, 2007
    Co-Authors: Kasper Peeters
    Abstract:

    Field theory is an area in physics with a deceptively compact notation. Although general purpose Computer Algebra Systems, built around generic list-based data structures, can be used to represent and manipulate field-theory expressions, this often leads to cumbersome input formats, unexpected side-effects, or the need for a lot of special-purpose code. This makes a direct translation of problems from paper to Computer and back needlessly time-consuming and error-prone. A prototype Computer Algebra System is presented which features TEX-like input, graph data structures, lists with Young-tableaux symmetries and a multiple-inheritance property System. The usefulness of this approach is illustrated with a number of explicit field-theory problems. 1. Field theory versus general-purpose Computer Algebra

  • introducing cadabra a symbolic Computer Algebra System for field theory problems
    arXiv: High Energy Physics - Theory, 2007
    Co-Authors: Kasper Peeters
    Abstract:

    Cadabra is a new Computer Algebra System designed specifically for the solution of problems encountered in field theory. It has extensive functionality for tensor polynomial simplification taking care of Bianchi and Schouten identities, for fermions and anti-commuting variables, Clifford Algebras and Fierz transformations, implicit coordinate dependence, multiple index types and many other field theory related concepts. The input format is a subset of TeX and thus easy to learn. Both a command-line and a graphical interface are available. The present paper is an introduction to the program using several concrete problems from gravity, supergravity and quantum field theory.

E. D. Kuznetsov - One of the best experts on this subject based on the ideXlab platform.

  • The Implementation of Hori–Deprit Method to the Construction Averaged Planetary Motion Theory by Means of Computer Algebra System Piranha
    Mathematics in Computer Science, 2019
    Co-Authors: A. S. Perminov, E. D. Kuznetsov
    Abstract:

    This article is related to the problem of the construction of planetary motion theory. We have expanded the Hamiltonian of the four-planetary problem into the Poisson series in osculating elements of the second Poincare System. The series expansion is constructed up to the third degree of the small parameter. The averaging procedure of the Hamiltonian is performed by the Hori–Deprit method. It allows to eliminate short-periodic perturbations and sufficiently increase time step of the integration of the equations of motion. This method is based on Lie transformation theory. The equations of motion in averaged elements are constructed as the Poisson brackets of the averaged Hamiltonian and corresponding orbital element. The transformation between averaged and osculating elements is given by the change-variable functions, which are obtained in the second approximation of the Hori–Deprit method. We used Computer Algebra System Piranha for the implementation of the Hori–Deprit method. Piranha is an echeloned Poisson series processor authored by F. Biscani. The properties of the obtained series are discussed. The numerical integration of the equations of motion is performed by Everhart method for the Solar System’s giant planets.

  • the construction of averaged planetary motion theory by means of Computer Algebra System piranha
    arXiv: Instrumentation and Methods for Astrophysics, 2018
    Co-Authors: A. S. Perminov, E. D. Kuznetsov
    Abstract:

    The application of Computer Algebra System Piranha to the investigation of the planetary problem is described in this work. Piranha is an echeloned Poisson series processor authored by F. Biscani from Max Planck Institute for Astronomy in Heidelberg. Using Piranha the averaged semi-analytical motion theory of four-planetary System is constructed up to the second degree of planetary masses. In this work we use the algorithm of the Hamiltonian expansion into the Poisson series in only orbital elements without other variables. The motion equations are obtained analytically in time-averaged elements by Hori-Deprit method. Piranha showed high-performance of analytical manipulations. Different properties of obtained series are discussed. The numerical integration of the motion equations is performed by Everhart method for the Solar System's giant-planets and some exoplanetary Systems.

Hiromi Ishii - One of the best experts on this subject based on the ideXlab platform.

  • a purely functional Computer Algebra System embedded in haskell
    Computer Algebra in Scientific Computing, 2018
    Co-Authors: Hiromi Ishii
    Abstract:

    We demonstrate how methods in Functional Programming can be used to implement a Computer Algebra System. As a proof-of-concept, we present the computational-Algebra package. It is a Computer Algebra System implemented as an embedded domain-specific language in Haskell, a purely functional programming language. Utilising methods in functional programming and prominent features of Haskell, this library achieves safety, composability, and correctness at the same time. To demonstrate the advantages of our approach, we have implemented advanced Grobner basis algorithms, such as Faugere’s \(F_4\) and \(F_5\), in a composable way.

  • CASC - A Purely Functional Computer Algebra System Embedded in Haskell
    Developments in Language Theory, 2018
    Co-Authors: Hiromi Ishii
    Abstract:

    We demonstrate how methods in Functional Programming can be used to implement a Computer Algebra System. As a proof-of-concept, we present the computational-Algebra package. It is a Computer Algebra System implemented as an embedded domain-specific language in Haskell, a purely functional programming language. Utilising methods in functional programming and prominent features of Haskell, this library achieves safety, composability, and correctness at the same time. To demonstrate the advantages of our approach, we have implemented advanced Grobner basis algorithms, such as Faugere’s \(F_4\) and \(F_5\), in a composable way.

Laurent Thery - One of the best experts on this subject based on the ideXlab platform.

S. Tertychniy - One of the best experts on this subject based on the ideXlab platform.