Results 51 to 60 of about 2,672 (199)

Programming and symbolic computation in Maude [PDF]

, 2020
[EN] Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories.
Rubén Rubio, Talcott, Carolyn, Escobar Román, Santiago, Durán, Francisco, Eker, Steven, NARCISO MARTÍ OLIET, José Meseguer   +6 more
core   +1 more source

Symbolic Algebraic Computation as a Way for Modeling Kinematical Tasks Themselves [PDF]

, 2003
The paper introduces the symbolic algebraic computational capability of Surface Constructor, a software tool for gear investigation. Use of symbolic expressions in the kinematical model gives a higher freedom in constructing and modifying the model ...
Dudás, László
core   +1 more source

Solution of polynomial Lyapunov and Sylvester equations

, 2006
A two-variable polynomial approach to solve the one-variable polynomial Lyapunov and Sylvester equations is proposed. Lifting the problem from the one-variable to the two-variable context gives rise to associated lifted equations which live on finite ...
Peeters, Ralf, Rapisarda, Paolo
core   +1 more source

Advances in the Design of Symbolic Computation Systems

, 1997
New methodological aspects related to design and implementation of symbolic computation systems are considered in this volume aiming at integrating such aspects into a homogeneous software environment for scientific computation.
TEMPERINI, Marco, Alfonso Miola
core  

A short history of algebraic statistics [PDF]

, 2008
In algebraic statistics, computational techniques from algebraic geometry become tools to address statistical problems. This, in turn, may prompt research in algebraic geometry. The basic ideas at the core of algebraic statistics will be presented. In
Eva Riccomagno, Riccomagno, Eva
core   +1 more source

Analog and symbolic computation through the Koopman framework

Journal of Physics: Complexity
We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that ...
Francesco Caravelli, Jean-Charles Delvenne   +1 more
doaj   +1 more source

A Note on Truncated Exponential-Based Appell Polynomials via Fractional Operators

Axioms
In this work, we construct a new class of Appell-type polynomials generated through extended truncated and truncated exponential kernels, and we analyze their core algebraic and operational features.
Waseem Ahmad Khan, Francesco Aldo Costabile, Khidir Shaib Mohamed, Alawia Adam, Shahid Ahmad Wani   +4 more
doaj   +1 more source

Towards Diagrammatic Specifications of Symbolic Computation Systems.

, 2005
The aim of this work is to present an ongoing project to formalize,in the framework of diagrammatic logic (due to Dominique Duvaland Christian Lair) some data structures appearing in Sergeraerts symbolic computation systems Kenzo and EAT. More precisely,
Rubio García, Julio, Lambán Pardo, Laureano, Duval, D., Domínguez Pérez, César   +3 more
core  

Structural features of algebraic quantum notations

Physical Review Special Topics. Physics Education Research, 2015
[This paper is part of the Focused Collection on Upper Division Physics Courses.] The formalism of quantum mechanics includes a rich collection of representations for describing quantum systems, including functions, graphs, matrices, histograms of ...
Elizabeth Gire, Edward Price
doaj   +1 more source

Symbolic Computation: Recent Progress and New Frontiers [PDF]

, 2002
Colloque sur invitation. internationale.International audienceSymbolic computation and computer algebra systems are usually known to be either very slow, or memory expensive.
Zimmermann, Paul
core