Search results for "Symbolic computation"

showing 10 items of 124 documents

Quark Contraction Tool -- QCT

2016

We present a Mathematica package for the calculation of Wick contractions in quantum field theories - QCT. Furthermore the package aims at automatically generating code for the calculation of physical matrix elements, suitable for numerical evaluation in a C++ program. To that end commonly used algebraic manipulations for the calculation of matrix elements in lattice QCD are implemented.

QuarkPhysicsQuantum chromodynamicsHigh Energy Physics - Lattice (hep-lat)Lattice field theoryFOS: Physical sciencesGeneral Physics and AstronomyLattice QCDDirected graphComputational Physics (physics.comp-ph)Symbolic computation01 natural sciences010305 fluids & plasmasAlgebraHigh Energy Physics - LatticeHardware and ArchitectureQuantum mechanics0103 physical sciencesComputer Science::Mathematical SoftwareAlgebraic numberQuantum field theory010306 general physicsPhysics - Computational Physics
researchProduct

Fast narrowing-driven partial evaluation for inductively sequential programs

2005

Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good results on small programs, it does not scale up well to realistic problems (e.g., interpreter specialization). In this work, we introduce a faster partial evaluation scheme by ensuring the termination of the process offline . For this purpose, we first characterize a class of programs which are quasi-terminating , i.e., the computations performed with needed narrowing—the symbolic computation mechanism of narrowing-driven partial evaluation—only contain finitely many different terms (and, thus, partial evaluation termi…

Scheme (programming language)Class (computer programming)Functional programmingTheoretical computer scienceComputer scienceComputationProgram transformationcomputer.software_genreSymbolic computationComputer Graphics and Computer-Aided DesignPartial evaluationProgram analysisLogical programmingSpecialization (logic)Automatic programmingcomputerSoftwareInterpretercomputer.programming_languageProceedings of the tenth ACM SIGPLAN international conference on Functional programming
researchProduct

xloops - Automated Feynman diagram calculation

1998

The program package xloops, a general, model independent tool for the calculation of high energy processes up to the two-loop level, is introduced. xloops calculates massive one- and two-loop Feynman diagrams in the standard model and related theories both analytically and numerically. A user-friendly Xwindows frontend is part of the package. xloops relies on the application of parallel space techniques. The treatment of tensor structure and the separation of divergences in analytic expressions is described in this scheme. All analytic calculations are performed with Maple. We describe the mathematical methods and computer algebra techniques xloops uses and give a brief introduction how to …

Scheme (programming language)Structure (category theory)General Physics and AstronomySymbolic computationNumerical integrationStandard Model (mathematical formulation)symbols.namesakeHardware and ArchitectureTensor (intrinsic definition)CalculussymbolsFeynman diagramPerturbation theory (quantum mechanics)computerMathematicscomputer.programming_language
researchProduct

Computer-aided synthesis of complex pump and valve operations

1988

Abstract Process plant operators often have to synthesize sequences of valve and pump operations. On large plants there may be so many possible pipe routes and vessels that it is not practical to provide a priori computer support for every possible operation. The paper describes a program that could form the basis of an operator aid to synthesize appropriate operations from a knowledge of the plant layout and existing pumping operations. The paper concentrates on finding paths through the pipework and on generating a sequence of operations that establishes the path whilst simultaneously satisfying other safety and operating constraints. The paper includes two example problems which were use…

SequenceEngineeringbusiness.industryGeneral Chemical EngineeringComputerApplications_COMPUTERSINOTHERSYSTEMSControl engineeringAbstract processSymbolic computationComputer Science ApplicationsOperator (computer programming)Mixing (mathematics)Storage tankPath (graph theory)A priori and a posterioribusinessComputers & Chemical Engineering
researchProduct

More Power through Symbolic Computation: Extending Stata by using the Maxima Computer algebra system

2015

Maxima is a free and open-source computer algebra system that can perform symbolic computations such as solving equations, determining derivatives of functions, obtaining Taylor series, and manipulating algebraic expressions. In this article, I present the Maxima Bridge System, which is a collection of software programs that allows Stata to interface with Maxima so that Maxima can be used for symbolic computation to transfer data from Stata to Maxima and to retrieve results from Maxima. The cooperation between Stata and Maxima provides an environment for statistical analysis in which symbolic computation can be easily used together with all the facilities supplied by Stata. In this environ…

Theoretical computer sciencebusiness.industryComputationInterface (computing)Symbolic computationsymbols.namesakeMathematics (miscellaneous)SoftwareComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONTaylor seriessymbolsAlgebraic expressionbusinessMaximaAlgorithmMathematicsEquation solvingThe Stata Journal: Promoting communications on statistics and Stata
researchProduct

"Table 208" of "Measurement of the correlation between flow harmonics of different order in lead-lead collisions at $\sqrt{s_{NN}}$=2.76 TeV with the…

2015

RMS eccentricity scaled v_n.

V2InclusiveMathematics::CombinatoricsMathematics::Probability2760.0Physics::Accelerator PhysicsComputer Science::Symbolic ComputationAstrophysics::Earth and Planetary AstrophysicsPB PB --> CHARGED X
researchProduct

"Table 207" of "Measurement of the correlation between flow harmonics of different order in lead-lead collisions at $\sqrt{s_{NN}}$=2.76 TeV with the…

2015

RMS eccentricity scaled v_n.

V2InclusiveMathematics::CombinatoricsMathematics::Probability2760.0Physics::Accelerator PhysicsComputer Science::Symbolic ComputationAstrophysics::Earth and Planetary AstrophysicsPB PB --> CHARGED X
researchProduct

"Figure 2.6" of "Measurements of Higher-Order Flow Harmonics in Au+Au Collisions at sqrt(s_NN) = 200 GeV"

2020

Charged hadron mean $$ in each $p_T$ bins used for the $v_n$ measurements in Au+Au collisions at 200 GeV.

V2Mathematics::CombinatoricsV4V3High Energy Physics::PhenomenologypTNUCLEUS NUCLEUS --> CHARGED XQuadrangular Flow200.0Triangular FlowInclusiveElliptic FlowTransverse MomentumAU AU --> CHARGED XComputer Science::Symbolic ComputationHigh Energy Physics::ExperimentNuclear Experiment
researchProduct

Algebraic-geometric techniques for the feedback classification and robustness of the optimal control of a pair of Bloch equations with application to…

2017

The aim of this article is to classify the singular trajectories associated with the optimal control problems of a pair of controlled Bloch equations. The motivation is to analyze the robustness of the optimal solutions to the contrast and the time-minimal saturation problem, in magnetic resonance imaging, with respect to the parameters and B1-inhomogeneity. For this purpose, we use various computer algebra algorithms and methods to study solutions of polynomial systems of equations and inequalities which are used for classification issues: Gröbner basis, cylindrical algebraic decomposition of semi-algebraic sets, Thom's isotopy lemma.

[ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC]optimal controlMSC. 49K15 14Q20 81Q93[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]singular trajectories[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]Bloch equationsMagnetic Resonance Imagingsymbolic computation
researchProduct

INCONSISTENCY IDENTIFICATION IN DYNAMIC ONTOLOGIES BASED ON MODEL CHECKING

2012

International audience; The increasing use of ontologies and the cost of changes support the need to manage the evolution of ontologies. A common kind of error in ontology evolution is the logical contradiction declined as incoherences and inconsistences. In this paper, we propose a new approach to predict and identify the incoherences and inconsistences in the evolution of ontologies based on temporal logic and ontology design patterns. We implement the proposed approach using the NuSMV model checker. Based on these patterns, we propose an automated process to guide and monitor the implementation of change while ensuring the consistency of the evolved ontology.

[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC][INFO.INFO-WB] Computer Science [cs]/Web[INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC][INFO.INFO-WB]Computer Science [cs]/Web[INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE][ INFO.INFO-WB ] Computer Science [cs]/Web[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]ComputingMethodologies_GENERAL[ INFO.INFO-SE ] Computer Science [cs]/Software Engineering [cs.SE][ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]
researchProduct