Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Rewrite Rules and Simplification of Matrix Expressions
Authors: John J Wavrik
– 0.23 Mb
Abstract
This paper concerns the automated simplification of expressions which involve non-commuting variables. The technology has been applied to the simplification of matrix and operator theory expressions which arise in engineering applications. The non-commutative variant of the Grobner Basis Algorithm is used to generate rewrite rules. We will also look at the phenomenon of infinite bases and implications for automated theorem proving.John J Wavrik,
Department of Mathematics,
University of California,
San Diego, California, USA
e-mail:
Department of Mathematics,
University of California,
San Diego, California, USA
e-mail:
Fulltext
– 0.23 Mb
Contents
- Some Features of CoCoA 3
- Algorithms in Singular
- Replicable functions: a computational approach
- Rewrite Rules and Simplification of Matrix Expressions
- An Implementation in C of an Algorithm for Construction of Finitely Presented Lie Superalgebrasz
- Constructing the Grobner basis using Anick's resolution in the noncommutative algebras
