A new algorithmic scheme for computing characteristic sets

Meng Jin Xiaoliang Li 1 Dongming Wang 2
2 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
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
Type de document :
Article dans une revue
Journal of Symbolic Computation, Elsevier, 2013, 50, pp.431-449. <10.1016/j.jsc.2012.04.004>
Liste complète des métadonnées

https://hal.inria.fr/hal-00793120
Contributeur : Brigitte Briot <>
Soumis le : jeudi 21 février 2013 - 16:12:48
Dernière modification le : lundi 29 mai 2017 - 14:26:17

Identifiants

Collections

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>

Partager

Métriques

Consultations de la notice

167