Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.jsc.2012.04.004 | J. Symb. Comput. |
Keywords | DocType | Volume |
generalized characteristic set,new algorithmic scheme,characteristic set,concrete subalgorithm,multivariate polynomial,admissible reduction,main operation,effective elimination strategy,proposed algorithm,experimental result,basic set | Journal | 50, |
ISSN | Citations | PageRank |
0747-7171 | 4 | 0.41 |
References | Authors | |
22 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meng Jin | 1 | 4 | 0.41 |
| Xiaoliang Li | 2 | 28 | 7.12 |
| Dongming Wang | 3 | 458 | 55.77 |