A new algorithmic scheme for computing characteristic sets

Abstract : 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
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-00793120
Contributor : Brigitte Briot <>
Submitted on : Thursday, February 21, 2013 - 4:12:48 PM
Last modification on : Thursday, March 21, 2019 - 2:54:10 PM

Links full text

Identifiers

Citation

Meng Jin, Xiaoliang Li, Dongming Wang. A new algorithmic scheme for computing characteristic sets. Journal of Symbolic Computation, Elsevier, 2013, 50, pp.431-449. ⟨10.1016/j.jsc.2012.04.004⟩. ⟨hal-00793120⟩

Share

Metrics

Record views

261