Resultant-based Elimination in Ore Algebra

05/31/2021
by   Raqeeb Rasheed, et al.
0

We consider resultant-based methods for elimination of indeterminates of Ore polynomial systems in Ore algebra. We start with defining the concept of resultant for bivariate Ore polynomials then compute it by the Dieudonne determinant of the polynomial coefficients. Additionally, we apply noncommutative versions of evaluation and interpolation techniques to the computation process to improve the efficiency of the method. The implementation of the algorithms will be performed in Maple to evaluate the performance of the approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2016

Upper bound for effective differential elimination

We present an upper bound for the number of differentiations in differen...
research
04/12/2016

Algorithmic computation of polynomial amoebas

We present algorithms for computation and visualization of amoebas, thei...
research
04/18/2021

Multigraded Sylvester forms, Duality and Elimination Matrices

In this paper we study the equations of the elimination ideal associated...
research
10/12/2018

Computing Elimination Ideals and Discriminants of Likelihood Equations

We develop a probabilistic algorithm for computing elimination ideals of...
research
05/05/2020

Learning selection strategies in Buchberger's algorithm

Studying the set of exact solutions of a system of polynomial equations ...
research
04/26/2018

Quantifier Elimination for Reasoning in Economics

We consider the use of Quantifier Elimination (QE) technology for automa...

Please sign up or login with your details

Forgot password? Click here to reset