Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4945893 | Journal of Symbolic Computation | 2018 | 34 Pages |
Abstract
To have smaller reduction systems, we develop a generalization of Bergman's setting. It allows overlapping domains of reduction homomorphisms, which also make the algorithmic verification of the confluence criterion more efficient. Moreover, we discuss a heuristic approach to complete a given reduction system to a confluent one in analogy to Buchberger's algorithm and Knuth-Bendix completion. Integro-differential operators are used to illustrate the tensor setting, verification of confluence, and completion of tensor reduction systems. We also introduce a confluent reduction system and normal forms for integro-differential operators with linear substitutions, which have applications in delay differential equations. Verification of the confluence criterion and completion based on S-polynomial computations is supported by the Mathematica package TenReS.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jamal Hossein Poor, Clemens G. Raab, Georg Regensburger,