A New Algorithmic Scheme for Computing Characteristic Sets

Details A New Algorithmic Scheme for Computing Characteristic Sets A New Algorithmic Scheme for Computing Characteristic Sets

2011-08-06

arxiv.org/abs/1108.1486v1

Computer Science

Symbolic Computation

25 pages, 3 algorithms and 6 tables

Scientific paper

Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing generalized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangularize polynomial sets using selected admissible reductions and several effective elimination strategies and to replace the algorithm of basic sets (used in Ritt-Wu's algorithm). The proposed algorithm has been implemented and experimental results show that it performs better than Ritt-Wu's algorithm in terms of computing time and simplicity of output for a number of non-trivial test examples.

Affiliated with

Also associated with

No associations

Rating

A New Algorithmic Scheme for Computing Characteristic Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Algorithmic Scheme for Computing Characteristic Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Algorithmic Scheme for Computing Characteristic Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1862