A new algorithmic scheme for computing characteristic sets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Symbolic Computation Année : 2013

A new algorithmic scheme for computing characteristic sets

Résumé

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

Dates et versions

hal-00793120 , version 1 (21-02-2013)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More